./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/heap-manipulation/dancing.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 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/heap-manipulation/dancing.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 c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:39:40,114 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:39:40,115 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:39:40,155 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:39:40,155 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:39:40,156 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:39:40,157 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:39:40,158 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:39:40,159 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:39:40,159 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:39:40,160 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:39:40,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:39:40,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:39:40,162 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:39:40,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:39:40,167 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:39:40,168 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:39:40,172 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:39:40,176 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:39:40,181 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:39:40,185 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:39:40,186 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:39:40,187 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:39:40,189 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:39:40,190 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:39:40,194 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:39:40,195 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:39:40,196 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:39:40,196 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:39:40,197 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:39:40,197 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:39:40,198 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:39:40,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:39:40,199 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:39:40,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:39:40,200 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:39:40,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:39:40,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:39:40,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:39:40,201 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:39:40,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:39:40,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:39:40,204 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:39:40,228 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:39:40,229 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:39:40,229 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:39:40,229 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:39:40,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:39:40,230 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:39:40,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:39:40,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:39:40,230 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:39:40,231 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:39:40,231 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:39:40,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:39:40,231 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:39:40,231 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:39:40,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:39:40,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:39:40,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:39:40,232 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:39:40,232 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:39:40,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:39:40,233 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:39:40,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:39:40,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:39:40,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:39:40,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:39:40,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:39:40,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:39:40,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:39:40,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:39:40,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:39:40,235 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 -> c2e0266b63b958a771d0226973905d5a39a7a28d05d194ae66381394d9ab520a [2022-07-14 06:39:40,436 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:39:40,463 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:39:40,465 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:39:40,466 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:39:40,467 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:39:40,468 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-14 06:39:40,519 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba7546/74419c3559704ee29c8fca6f670639b7/FLAGf262afff0 [2022-07-14 06:39:40,918 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:39:40,918 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/dancing.i [2022-07-14 06:39:40,925 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba7546/74419c3559704ee29c8fca6f670639b7/FLAGf262afff0 [2022-07-14 06:39:40,934 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/953ba7546/74419c3559704ee29c8fca6f670639b7 [2022-07-14 06:39:40,936 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:39:40,937 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:39:40,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:39:40,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:39:40,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:39:40,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:39:40" (1/1) ... [2022-07-14 06:39:40,943 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b0e0db1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:40, skipping insertion in model container [2022-07-14 06:39:40,944 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:39:40" (1/1) ... [2022-07-14 06:39:40,949 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:39:40,969 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:39:41,102 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/heap-manipulation/dancing.i[938,951] [2022-07-14 06:39:41,167 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:39:41,172 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:39:41,185 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/heap-manipulation/dancing.i[938,951] [2022-07-14 06:39:41,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:39:41,239 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:39:41,241 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41 WrapperNode [2022-07-14 06:39:41,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:39:41,242 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:39:41,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:39:41,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:39:41,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,259 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,276 INFO L137 Inliner]: procedures = 124, calls = 40, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 90 [2022-07-14 06:39:41,276 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:39:41,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:39:41,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:39:41,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:39:41,282 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,283 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,285 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,289 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,291 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,292 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,296 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:39:41,296 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:39:41,296 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:39:41,297 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:39:41,297 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (1/1) ... [2022-07-14 06:39:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:39:41,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:41,322 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-14 06:39:41,324 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-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure is_list_containing_x [2022-07-14 06:39:41,360 INFO L138 BoogieDeclarations]: Found implementation of procedure is_list_containing_x [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-14 06:39:41,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 06:39:41,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:39:41,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:39:41,459 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:39:41,460 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:39:41,667 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:39:41,672 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:39:41,672 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 06:39:41,674 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:39:41 BoogieIcfgContainer [2022-07-14 06:39:41,674 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:39:41,675 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:39:41,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:39:41,677 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:39:41,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:39:40" (1/3) ... [2022-07-14 06:39:41,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20633772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:39:41, skipping insertion in model container [2022-07-14 06:39:41,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:39:41" (2/3) ... [2022-07-14 06:39:41,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20633772 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:39:41, skipping insertion in model container [2022-07-14 06:39:41,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:39:41" (3/3) ... [2022-07-14 06:39:41,679 INFO L111 eAbstractionObserver]: Analyzing ICFG dancing.i [2022-07-14 06:39:41,689 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:39:41,689 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 44 error locations. [2022-07-14 06:39:41,719 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:39:41,725 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@192ba0e6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@f6006ac [2022-07-14 06:39:41,725 INFO L358 AbstractCegarLoop]: Starting to check reachability of 44 error locations. [2022-07-14 06:39:41,729 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:39:41,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:39:41,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:41,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:39:41,752 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:41,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:41,759 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-14 06:39:41,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:41,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27669806] [2022-07-14 06:39:41,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:41,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:41,881 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-14 06:39:41,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:41,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27669806] [2022-07-14 06:39:41,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27669806] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:41,883 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:41,883 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:41,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [921751996] [2022-07-14 06:39:41,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:41,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:41,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:41,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:41,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:41,916 INFO L87 Difference]: Start difference. First operand has 108 states, 55 states have (on average 2.036363636363636) internal successors, (112), 99 states have internal predecessors, (112), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) 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-14 06:39:42,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,026 INFO L93 Difference]: Finished difference Result 106 states and 119 transitions. [2022-07-14 06:39:42,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:42,029 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-14 06:39:42,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,037 INFO L225 Difference]: With dead ends: 106 [2022-07-14 06:39:42,037 INFO L226 Difference]: Without dead ends: 104 [2022-07-14 06:39:42,039 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-14 06:39:42,043 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 94 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:42,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-07-14 06:39:42,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-07-14 06:39:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 54 states have (on average 1.9444444444444444) internal successors, (105), 95 states have internal predecessors, (105), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:39:42,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 117 transitions. [2022-07-14 06:39:42,085 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 117 transitions. Word has length 3 [2022-07-14 06:39:42,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,085 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 117 transitions. [2022-07-14 06:39:42,086 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-14 06:39:42,086 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 117 transitions. [2022-07-14 06:39:42,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-14 06:39:42,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,087 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-14 06:39:42,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:39:42,087 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,088 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-14 06:39:42,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889813431] [2022-07-14 06:39:42,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,140 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-14 06:39:42,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,141 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889813431] [2022-07-14 06:39:42,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889813431] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:42,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970407735] [2022-07-14 06:39:42,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:42,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:42,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:42,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:42,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:42,144 INFO L87 Difference]: Start difference. First operand 104 states and 117 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-14 06:39:42,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,212 INFO L93 Difference]: Finished difference Result 102 states and 115 transitions. [2022-07-14 06:39:42,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:42,213 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-14 06:39:42,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,217 INFO L225 Difference]: With dead ends: 102 [2022-07-14 06:39:42,217 INFO L226 Difference]: Without dead ends: 102 [2022-07-14 06:39:42,217 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-14 06:39:42,218 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 80 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,218 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 92 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:42,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-14 06:39:42,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-14 06:39:42,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 93 states have internal predecessors, (103), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:39:42,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 115 transitions. [2022-07-14 06:39:42,224 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 115 transitions. Word has length 3 [2022-07-14 06:39:42,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,224 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 115 transitions. [2022-07-14 06:39:42,224 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-14 06:39:42,224 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 115 transitions. [2022-07-14 06:39:42,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:39:42,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,225 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:42,225 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:39:42,225 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,225 INFO L85 PathProgramCache]: Analyzing trace with hash 59267633, now seen corresponding path program 1 times [2022-07-14 06:39:42,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680869079] [2022-07-14 06:39:42,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,269 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-14 06:39:42,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680869079] [2022-07-14 06:39:42,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680869079] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,270 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:42,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612998138] [2022-07-14 06:39:42,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:42,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:42,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:42,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:42,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:42,271 INFO L87 Difference]: Start difference. First operand 102 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 06:39:42,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,366 INFO L93 Difference]: Finished difference Result 165 states and 189 transitions. [2022-07-14 06:39:42,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:42,367 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-14 06:39:42,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,370 INFO L225 Difference]: With dead ends: 165 [2022-07-14 06:39:42,370 INFO L226 Difference]: Without dead ends: 165 [2022-07-14 06:39:42,371 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-14 06:39:42,376 INFO L413 NwaCegarLoop]: 150 mSDtfsCounter, 74 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 213 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:42,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-14 06:39:42,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 100. [2022-07-14 06:39:42,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.8703703703703705) internal successors, (101), 91 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:39:42,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-14 06:39:42,394 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 8 [2022-07-14 06:39:42,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,395 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-14 06:39:42,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 06:39:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-14 06:39:42,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-14 06:39:42,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,395 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:42,396 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:39:42,396 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,397 INFO L85 PathProgramCache]: Analyzing trace with hash 59267634, now seen corresponding path program 1 times [2022-07-14 06:39:42,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794140088] [2022-07-14 06:39:42,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,465 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-14 06:39:42,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794140088] [2022-07-14 06:39:42,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794140088] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:39:42,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231562710] [2022-07-14 06:39:42,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:42,468 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:42,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:42,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:42,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:42,469 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 06:39:42,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,563 INFO L93 Difference]: Finished difference Result 165 states and 188 transitions. [2022-07-14 06:39:42,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:42,565 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 8 [2022-07-14 06:39:42,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,566 INFO L225 Difference]: With dead ends: 165 [2022-07-14 06:39:42,566 INFO L226 Difference]: Without dead ends: 165 [2022-07-14 06:39:42,566 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-14 06:39:42,567 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 74 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 217 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:42,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-14 06:39:42,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 98. [2022-07-14 06:39:42,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 54 states have (on average 1.8333333333333333) internal successors, (99), 89 states have internal predecessors, (99), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-07-14 06:39:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-14 06:39:42,589 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 8 [2022-07-14 06:39:42,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,589 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-14 06:39:42,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-14 06:39:42,590 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-14 06:39:42,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:39:42,590 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:42,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:39:42,591 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1124238034, now seen corresponding path program 1 times [2022-07-14 06:39:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710883588] [2022-07-14 06:39:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,654 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-14 06:39:42,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710883588] [2022-07-14 06:39:42,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710883588] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:42,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575010881] [2022-07-14 06:39:42,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:42,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:42,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:42,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:42,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:42,657 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:42,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,727 INFO L93 Difference]: Finished difference Result 176 states and 204 transitions. [2022-07-14 06:39:42,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:42,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-14 06:39:42,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,730 INFO L225 Difference]: With dead ends: 176 [2022-07-14 06:39:42,730 INFO L226 Difference]: Without dead ends: 176 [2022-07-14 06:39:42,730 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:42,731 INFO L413 NwaCegarLoop]: 107 mSDtfsCounter, 78 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 403 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:42,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-14 06:39:42,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 142. [2022-07-14 06:39:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 93 states have (on average 1.89247311827957) internal successors, (176), 129 states have internal predecessors, (176), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:39:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 196 transitions. [2022-07-14 06:39:42,740 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 196 transitions. Word has length 10 [2022-07-14 06:39:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,740 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 196 transitions. [2022-07-14 06:39:42,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.8) internal successors, (9), 4 states have internal predecessors, (9), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 196 transitions. [2022-07-14 06:39:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-14 06:39:42,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:42,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:39:42,741 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1121620373, now seen corresponding path program 1 times [2022-07-14 06:39:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534694883] [2022-07-14 06:39:42,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,824 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-14 06:39:42,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534694883] [2022-07-14 06:39:42,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534694883] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,824 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,824 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:42,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465632312] [2022-07-14 06:39:42,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:42,825 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:42,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:42,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:42,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:42,825 INFO L87 Difference]: Start difference. First operand 142 states and 196 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-14 06:39:42,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:42,921 INFO L93 Difference]: Finished difference Result 140 states and 192 transitions. [2022-07-14 06:39:42,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:39:42,922 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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 10 [2022-07-14 06:39:42,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:42,923 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:39:42,923 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:39:42,924 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-14 06:39:42,924 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 218 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:42,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 105 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:42,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:39:42,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2022-07-14 06:39:42,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 127 states have internal predecessors, (172), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:39:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 192 transitions. [2022-07-14 06:39:42,942 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 192 transitions. Word has length 10 [2022-07-14 06:39:42,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:42,942 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 192 transitions. [2022-07-14 06:39:42,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 states have internal predecessors, (10), 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-14 06:39:42,942 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 192 transitions. [2022-07-14 06:39:42,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:39:42,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:42,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:42,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:39:42,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:42,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:42,943 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990355, now seen corresponding path program 1 times [2022-07-14 06:39:42,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:42,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614847004] [2022-07-14 06:39:42,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:42,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:42,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:42,999 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-14 06:39:42,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:42,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614847004] [2022-07-14 06:39:42,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614847004] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:42,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:42,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:43,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073626251] [2022-07-14 06:39:43,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:43,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:43,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:43,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:43,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:43,001 INFO L87 Difference]: Start difference. First operand 140 states and 192 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:43,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:43,180 INFO L93 Difference]: Finished difference Result 159 states and 184 transitions. [2022-07-14 06:39:43,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:43,181 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:39:43,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:43,182 INFO L225 Difference]: With dead ends: 159 [2022-07-14 06:39:43,182 INFO L226 Difference]: Without dead ends: 159 [2022-07-14 06:39:43,182 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:43,183 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 238 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:43,183 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 203 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:39:43,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-07-14 06:39:43,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 135. [2022-07-14 06:39:43,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.7311827956989247) internal successors, (161), 122 states have internal predecessors, (161), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:39:43,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 181 transitions. [2022-07-14 06:39:43,188 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 181 transitions. Word has length 15 [2022-07-14 06:39:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:43,189 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 181 transitions. [2022-07-14 06:39:43,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:43,189 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 181 transitions. [2022-07-14 06:39:43,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-14 06:39:43,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:43,189 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:43,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 06:39:43,190 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:43,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:43,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1910990356, now seen corresponding path program 1 times [2022-07-14 06:39:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:43,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696512099] [2022-07-14 06:39:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:43,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:43,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:43,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:43,275 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-14 06:39:43,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:43,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696512099] [2022-07-14 06:39:43,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696512099] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:43,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:43,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:43,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252020351] [2022-07-14 06:39:43,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:43,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:43,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:43,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:43,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:43,277 INFO L87 Difference]: Start difference. First operand 135 states and 181 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:43,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:43,412 INFO L93 Difference]: Finished difference Result 155 states and 179 transitions. [2022-07-14 06:39:43,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:43,413 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-07-14 06:39:43,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:43,414 INFO L225 Difference]: With dead ends: 155 [2022-07-14 06:39:43,414 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:39:43,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:43,414 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 288 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:43,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 186 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:43,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:39:43,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 135. [2022-07-14 06:39:43,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 93 states have (on average 1.6666666666666667) internal successors, (155), 122 states have internal predecessors, (155), 10 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-07-14 06:39:43,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 175 transitions. [2022-07-14 06:39:43,418 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 175 transitions. Word has length 15 [2022-07-14 06:39:43,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:43,418 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 175 transitions. [2022-07-14 06:39:43,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:43,418 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 175 transitions. [2022-07-14 06:39:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:39:43,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:43,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:43,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:39:43,419 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:43,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:43,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148901, now seen corresponding path program 1 times [2022-07-14 06:39:43,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:43,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [261576871] [2022-07-14 06:39:43,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:43,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:43,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:43,452 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:43,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:43,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [261576871] [2022-07-14 06:39:43,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [261576871] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:43,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622252547] [2022-07-14 06:39:43,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:43,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:43,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:43,454 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-14 06:39:43,467 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-14 06:39:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:43,533 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:39:43,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:43,597 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-14 06:39:43,644 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:43,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:39:43,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:43,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:43,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:43,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622252547] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:43,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:43,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 14 [2022-07-14 06:39:43,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606654298] [2022-07-14 06:39:43,951 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:43,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-14 06:39:43,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:43,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-14 06:39:43,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=172, Unknown=0, NotChecked=0, Total=210 [2022-07-14 06:39:43,952 INFO L87 Difference]: Start difference. First operand 135 states and 175 transitions. Second operand has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:44,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:44,341 INFO L93 Difference]: Finished difference Result 200 states and 254 transitions. [2022-07-14 06:39:44,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:39:44,341 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:39:44,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:44,342 INFO L225 Difference]: With dead ends: 200 [2022-07-14 06:39:44,342 INFO L226 Difference]: Without dead ends: 200 [2022-07-14 06:39:44,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=272, Unknown=0, NotChecked=0, Total=342 [2022-07-14 06:39:44,343 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 362 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 589 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 447 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:44,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 447 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 589 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:39:44,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-07-14 06:39:44,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 143. [2022-07-14 06:39:44,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 100 states have (on average 1.65) internal successors, (165), 128 states have internal predecessors, (165), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 06:39:44,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 187 transitions. [2022-07-14 06:39:44,347 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 187 transitions. Word has length 16 [2022-07-14 06:39:44,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:44,347 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 187 transitions. [2022-07-14 06:39:44,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 2.642857142857143) internal successors, (37), 12 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:44,347 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 187 transitions. [2022-07-14 06:39:44,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:39:44,348 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:44,348 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:44,368 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-14 06:39:44,548 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:44,548 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:44,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:44,549 INFO L85 PathProgramCache]: Analyzing trace with hash 1007148902, now seen corresponding path program 1 times [2022-07-14 06:39:44,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:44,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395230795] [2022-07-14 06:39:44,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:44,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:44,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:44,630 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:44,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:44,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395230795] [2022-07-14 06:39:44,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395230795] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:44,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1803473075] [2022-07-14 06:39:44,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:44,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:44,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:44,632 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-14 06:39:44,632 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-14 06:39:44,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:44,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-14 06:39:44,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:44,742 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:44,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2022-07-14 06:39:44,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:44,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:45,016 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 18 treesize of output 14 [2022-07-14 06:39:45,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:45,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1803473075] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:45,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:45,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 15 [2022-07-14 06:39:45,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922039487] [2022-07-14 06:39:45,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,028 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:39:45,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:39:45,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:39:45,029 INFO L87 Difference]: Start difference. First operand 143 states and 187 transitions. Second operand has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,450 INFO L93 Difference]: Finished difference Result 197 states and 251 transitions. [2022-07-14 06:39:45,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:39:45,451 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:39:45,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,451 INFO L225 Difference]: With dead ends: 197 [2022-07-14 06:39:45,452 INFO L226 Difference]: Without dead ends: 197 [2022-07-14 06:39:45,452 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:39:45,452 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 495 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 497 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 666 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:39:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-07-14 06:39:45,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 142. [2022-07-14 06:39:45,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 100 states have (on average 1.62) internal successors, (162), 127 states have internal predecessors, (162), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-07-14 06:39:45,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 184 transitions. [2022-07-14 06:39:45,456 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 184 transitions. Word has length 16 [2022-07-14 06:39:45,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,457 INFO L495 AbstractCegarLoop]: Abstraction has 142 states and 184 transitions. [2022-07-14 06:39:45,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 2.4) internal successors, (36), 13 states have internal predecessors, (36), 3 states have call successors, (3), 3 states have call predecessors, (3), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:45,457 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 184 transitions. [2022-07-14 06:39:45,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-14 06:39:45,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,457 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,486 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-14 06:39:45,658 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,SelfDestructingSolverStorable9 [2022-07-14 06:39:45,658 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:45,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,658 INFO L85 PathProgramCache]: Analyzing trace with hash -992190633, now seen corresponding path program 1 times [2022-07-14 06:39:45,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98120647] [2022-07-14 06:39:45,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:45,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:45,755 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-14 06:39:45,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:45,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98120647] [2022-07-14 06:39:45,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98120647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:45,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:45,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:39:45,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890901061] [2022-07-14 06:39:45,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:45,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:39:45,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:45,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:39:45,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:45,758 INFO L87 Difference]: Start difference. First operand 142 states and 184 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:45,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:45,933 INFO L93 Difference]: Finished difference Result 190 states and 242 transitions. [2022-07-14 06:39:45,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:39:45,934 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-07-14 06:39:45,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:45,935 INFO L225 Difference]: With dead ends: 190 [2022-07-14 06:39:45,935 INFO L226 Difference]: Without dead ends: 190 [2022-07-14 06:39:45,935 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:39:45,936 INFO L413 NwaCegarLoop]: 90 mSDtfsCounter, 187 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:45,936 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 395 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-14 06:39:45,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 150. [2022-07-14 06:39:45,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 107 states have (on average 1.5981308411214954) internal successors, (171), 134 states have internal predecessors, (171), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 06:39:45,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 195 transitions. [2022-07-14 06:39:45,942 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 195 transitions. Word has length 19 [2022-07-14 06:39:45,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:45,942 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 195 transitions. [2022-07-14 06:39:45,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:45,942 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 195 transitions. [2022-07-14 06:39:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:39:45,943 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:45,943 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:45,944 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:39:45,944 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:45,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:45,944 INFO L85 PathProgramCache]: Analyzing trace with hash 343557913, now seen corresponding path program 1 times [2022-07-14 06:39:45,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:45,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215968497] [2022-07-14 06:39:45,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:45,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,013 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-14 06:39:46,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:46,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215968497] [2022-07-14 06:39:46,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215968497] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:46,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:46,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:39:46,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536796802] [2022-07-14 06:39:46,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:46,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:39:46,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:46,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:39:46,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:39:46,016 INFO L87 Difference]: Start difference. First operand 150 states and 195 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:46,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:46,149 INFO L93 Difference]: Finished difference Result 185 states and 236 transitions. [2022-07-14 06:39:46,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:46,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-07-14 06:39:46,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:46,150 INFO L225 Difference]: With dead ends: 185 [2022-07-14 06:39:46,151 INFO L226 Difference]: Without dead ends: 185 [2022-07-14 06:39:46,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:39:46,151 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 135 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:46,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 397 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:46,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-14 06:39:46,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 152. [2022-07-14 06:39:46,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 109 states have (on average 1.5871559633027523) internal successors, (173), 136 states have internal predecessors, (173), 12 states have call successors, (12), 4 states have call predecessors, (12), 4 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-07-14 06:39:46,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 197 transitions. [2022-07-14 06:39:46,157 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 197 transitions. Word has length 21 [2022-07-14 06:39:46,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:46,157 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 197 transitions. [2022-07-14 06:39:46,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:46,158 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 197 transitions. [2022-07-14 06:39:46,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:39:46,159 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:46,159 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:46,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:39:46,159 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:46,160 INFO L85 PathProgramCache]: Analyzing trace with hash 451808416, now seen corresponding path program 1 times [2022-07-14 06:39:46,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:46,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777347552] [2022-07-14 06:39:46,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:46,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:46,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,288 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:46,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:46,288 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777347552] [2022-07-14 06:39:46,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777347552] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:46,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1047988892] [2022-07-14 06:39:46,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:46,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:46,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:46,290 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-14 06:39:46,291 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-14 06:39:46,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:46,356 INFO L263 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-14 06:39:46,357 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:46,371 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-14 06:39:46,410 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 13 treesize of output 9 [2022-07-14 06:39:46,487 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 17 treesize of output 9 [2022-07-14 06:39:46,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:46,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:46,582 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 42 treesize of output 36 [2022-07-14 06:39:46,665 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:46,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1047988892] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:46,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:46,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 9] total 24 [2022-07-14 06:39:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031556814] [2022-07-14 06:39:46,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:46,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-14 06:39:46,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-14 06:39:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=493, Unknown=0, NotChecked=0, Total=552 [2022-07-14 06:39:46,666 INFO L87 Difference]: Start difference. First operand 152 states and 197 transitions. Second operand has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:47,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:47,920 INFO L93 Difference]: Finished difference Result 500 states and 656 transitions. [2022-07-14 06:39:47,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-14 06:39:47,920 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:39:47,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:47,923 INFO L225 Difference]: With dead ends: 500 [2022-07-14 06:39:47,923 INFO L226 Difference]: Without dead ends: 500 [2022-07-14 06:39:47,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=214, Invalid=1426, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 06:39:47,924 INFO L413 NwaCegarLoop]: 124 mSDtfsCounter, 1024 mSDsluCounter, 1511 mSDsCounter, 0 mSdLazyCounter, 1932 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 1635 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:47,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 1635 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1932 Invalid, 0 Unknown, 100 Unchecked, 0.9s Time] [2022-07-14 06:39:47,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2022-07-14 06:39:47,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 237. [2022-07-14 06:39:47,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5795454545454546) internal successors, (278), 206 states have internal predecessors, (278), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 06:39:47,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 328 transitions. [2022-07-14 06:39:47,942 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 328 transitions. Word has length 22 [2022-07-14 06:39:47,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:47,942 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 328 transitions. [2022-07-14 06:39:47,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 19 states have internal predecessors, (51), 5 states have call successors, (5), 5 states have call predecessors, (5), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:39:47,943 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 328 transitions. [2022-07-14 06:39:47,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:39:47,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:47,945 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:47,977 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-14 06:39:48,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:48,163 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:48,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash 1286860128, now seen corresponding path program 1 times [2022-07-14 06:39:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:48,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040982603] [2022-07-14 06:39:48,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:48,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040982603] [2022-07-14 06:39:48,200 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040982603] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:48,200 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530072189] [2022-07-14 06:39:48,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:48,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:48,202 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-14 06:39:48,203 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-14 06:39:48,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-14 06:39:48,269 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:48,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:48,325 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:48,412 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:48,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530072189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:48,413 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:48,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-14 06:39:48,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988179519] [2022-07-14 06:39:48,413 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:48,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-14 06:39:48,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:48,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-14 06:39:48,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:39:48,415 INFO L87 Difference]: Start difference. First operand 237 states and 328 transitions. Second operand has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:48,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:48,752 INFO L93 Difference]: Finished difference Result 305 states and 388 transitions. [2022-07-14 06:39:48,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:48,753 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) Word has length 21 [2022-07-14 06:39:48,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:48,754 INFO L225 Difference]: With dead ends: 305 [2022-07-14 06:39:48,754 INFO L226 Difference]: Without dead ends: 299 [2022-07-14 06:39:48,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2022-07-14 06:39:48,755 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 299 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 701 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 301 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:48,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [301 Valid, 630 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 701 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:39:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-07-14 06:39:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 237. [2022-07-14 06:39:48,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 237 states, 176 states have (on average 1.5625) internal successors, (275), 206 states have internal predecessors, (275), 25 states have call successors, (25), 9 states have call predecessors, (25), 9 states have return successors, (25), 21 states have call predecessors, (25), 25 states have call successors, (25) [2022-07-14 06:39:48,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 325 transitions. [2022-07-14 06:39:48,761 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 325 transitions. Word has length 21 [2022-07-14 06:39:48,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:48,761 INFO L495 AbstractCegarLoop]: Abstraction has 237 states and 325 transitions. [2022-07-14 06:39:48,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.875) internal successors, (46), 16 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 1 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:48,761 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 325 transitions. [2022-07-14 06:39:48,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-14 06:39:48,761 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:48,761 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:48,779 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-14 06:39:48,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:48,975 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:48,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:48,976 INFO L85 PathProgramCache]: Analyzing trace with hash -1821114983, now seen corresponding path program 1 times [2022-07-14 06:39:48,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:48,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146273059] [2022-07-14 06:39:48,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:48,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:48,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:48,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:49,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,001 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-14 06:39:49,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146273059] [2022-07-14 06:39:49,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146273059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:49,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028264313] [2022-07-14 06:39:49,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:49,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:49,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:49,002 INFO L87 Difference]: Start difference. First operand 237 states and 325 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,018 INFO L93 Difference]: Finished difference Result 251 states and 343 transitions. [2022-07-14 06:39:49,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:49,020 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-07-14 06:39:49,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,021 INFO L225 Difference]: With dead ends: 251 [2022-07-14 06:39:49,021 INFO L226 Difference]: Without dead ends: 251 [2022-07-14 06:39:49,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:49,021 INFO L413 NwaCegarLoop]: 100 mSDtfsCounter, 6 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,021 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 389 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:49,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-07-14 06:39:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 246. [2022-07-14 06:39:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 179 states have (on average 1.553072625698324) internal successors, (278), 214 states have internal predecessors, (278), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-14 06:39:49,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 338 transitions. [2022-07-14 06:39:49,034 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 338 transitions. Word has length 24 [2022-07-14 06:39:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,034 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 338 transitions. [2022-07-14 06:39:49,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,034 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 338 transitions. [2022-07-14 06:39:49,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:39:49,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,035 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:49,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:39:49,035 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:49,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,035 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275188, now seen corresponding path program 1 times [2022-07-14 06:39:49,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313893413] [2022-07-14 06:39:49,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,063 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:49,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313893413] [2022-07-14 06:39:49,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313893413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:39:49,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143624795] [2022-07-14 06:39:49,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:49,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:49,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:49,064 INFO L87 Difference]: Start difference. First operand 246 states and 338 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,228 INFO L93 Difference]: Finished difference Result 304 states and 389 transitions. [2022-07-14 06:39:49,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:39:49,229 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-14 06:39:49,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,230 INFO L225 Difference]: With dead ends: 304 [2022-07-14 06:39:49,230 INFO L226 Difference]: Without dead ends: 304 [2022-07-14 06:39:49,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:49,231 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 206 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 254 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:49,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2022-07-14 06:39:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 245. [2022-07-14 06:39:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 245 states, 179 states have (on average 1.541899441340782) internal successors, (276), 213 states have internal predecessors, (276), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-14 06:39:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 336 transitions. [2022-07-14 06:39:49,236 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 336 transitions. Word has length 23 [2022-07-14 06:39:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,236 INFO L495 AbstractCegarLoop]: Abstraction has 245 states and 336 transitions. [2022-07-14 06:39:49,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 336 transitions. [2022-07-14 06:39:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-14 06:39:49,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:39:49,237 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:49,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1983275187, now seen corresponding path program 1 times [2022-07-14 06:39:49,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798903621] [2022-07-14 06:39:49,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:49,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:49,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798903621] [2022-07-14 06:39:49,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798903621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:49,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:49,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:39:49,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292155346] [2022-07-14 06:39:49,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:49,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:49,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:49,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:49,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:49,304 INFO L87 Difference]: Start difference. First operand 245 states and 336 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:49,452 INFO L93 Difference]: Finished difference Result 302 states and 382 transitions. [2022-07-14 06:39:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:39:49,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-07-14 06:39:49,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:49,456 INFO L225 Difference]: With dead ends: 302 [2022-07-14 06:39:49,456 INFO L226 Difference]: Without dead ends: 302 [2022-07-14 06:39:49,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:39:49,457 INFO L413 NwaCegarLoop]: 136 mSDtfsCounter, 194 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 349 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:49,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 349 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2022-07-14 06:39:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 239. [2022-07-14 06:39:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 179 states have (on average 1.4916201117318435) internal successors, (267), 207 states have internal predecessors, (267), 30 states have call successors, (30), 10 states have call predecessors, (30), 10 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-14 06:39:49,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 327 transitions. [2022-07-14 06:39:49,462 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 327 transitions. Word has length 23 [2022-07-14 06:39:49,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:49,462 INFO L495 AbstractCegarLoop]: Abstraction has 239 states and 327 transitions. [2022-07-14 06:39:49,463 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:49,463 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 327 transitions. [2022-07-14 06:39:49,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:39:49,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:49,463 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:49,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:39:49,463 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:49,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:49,463 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398490, now seen corresponding path program 1 times [2022-07-14 06:39:49,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:49,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127166545] [2022-07-14 06:39:49,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:49,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,777 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:49,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:49,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127166545] [2022-07-14 06:39:49,778 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127166545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:49,778 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1868380989] [2022-07-14 06:39:49,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:49,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:49,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:49,784 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-14 06:39:49,785 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-14 06:39:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:49,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:39:49,860 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:49,885 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-14 06:39:49,922 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 13 treesize of output 9 [2022-07-14 06:39:50,101 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:39:50,102 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 21 treesize of output 21 [2022-07-14 06:39:50,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:50,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:50,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1868380989] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:50,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:39:50,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9] total 22 [2022-07-14 06:39:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041452220] [2022-07-14 06:39:50,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:50,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:39:50,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:50,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:39:50,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=566, Unknown=0, NotChecked=0, Total=650 [2022-07-14 06:39:50,258 INFO L87 Difference]: Start difference. First operand 239 states and 327 transitions. Second operand has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:51,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:51,732 INFO L93 Difference]: Finished difference Result 552 states and 721 transitions. [2022-07-14 06:39:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:39:51,732 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 25 [2022-07-14 06:39:51,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:51,734 INFO L225 Difference]: With dead ends: 552 [2022-07-14 06:39:51,734 INFO L226 Difference]: Without dead ends: 552 [2022-07-14 06:39:51,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 490 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=1576, Unknown=0, NotChecked=0, Total=1892 [2022-07-14 06:39:51,735 INFO L413 NwaCegarLoop]: 172 mSDtfsCounter, 594 mSDsluCounter, 1796 mSDsCounter, 0 mSdLazyCounter, 1669 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 603 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 2464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 1669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 654 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:51,735 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [603 Valid, 1968 Invalid, 2464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 1669 Invalid, 0 Unknown, 654 Unchecked, 0.8s Time] [2022-07-14 06:39:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2022-07-14 06:39:51,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 252. [2022-07-14 06:39:51,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 190 states have (on average 1.4736842105263157) internal successors, (280), 218 states have internal predecessors, (280), 31 states have call successors, (31), 11 states have call predecessors, (31), 11 states have return successors, (31), 22 states have call predecessors, (31), 31 states have call successors, (31) [2022-07-14 06:39:51,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 342 transitions. [2022-07-14 06:39:51,742 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 342 transitions. Word has length 25 [2022-07-14 06:39:51,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:51,742 INFO L495 AbstractCegarLoop]: Abstraction has 252 states and 342 transitions. [2022-07-14 06:39:51,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.0) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:51,742 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 342 transitions. [2022-07-14 06:39:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-14 06:39:51,742 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:51,743 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:51,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-14 06:39:51,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-14 06:39:51,943 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:51,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2147398489, now seen corresponding path program 1 times [2022-07-14 06:39:51,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:51,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127636720] [2022-07-14 06:39:51,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:51,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:52,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:52,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:52,309 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:52,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127636720] [2022-07-14 06:39:52,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127636720] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:52,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [146025961] [2022-07-14 06:39:52,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:52,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:52,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:52,311 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:39:52,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:39:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:52,383 INFO L263 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-14 06:39:52,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:52,447 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 13 treesize of output 9 [2022-07-14 06:39:52,451 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 13 treesize of output 9 [2022-07-14 06:39:52,554 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 21 treesize of output 9 [2022-07-14 06:39:52,557 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 19 treesize of output 7 [2022-07-14 06:39:52,573 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:52,573 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:52,665 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 78 treesize of output 72 [2022-07-14 06:39:52,667 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 118 treesize of output 106 [2022-07-14 06:39:52,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:52,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:39:52,733 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 8 treesize of output 6 [2022-07-14 06:39:52,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:52,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [146025961] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:39:52,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:39:52,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 7] total 26 [2022-07-14 06:39:52,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [35045506] [2022-07-14 06:39:52,755 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:39:52,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-07-14 06:39:52,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:52,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-07-14 06:39:52,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=618, Unknown=0, NotChecked=0, Total=702 [2022-07-14 06:39:52,756 INFO L87 Difference]: Start difference. First operand 252 states and 342 transitions. Second operand has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:54,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:54,213 INFO L93 Difference]: Finished difference Result 410 states and 506 transitions. [2022-07-14 06:39:54,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:39:54,213 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2022-07-14 06:39:54,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:54,215 INFO L225 Difference]: With dead ends: 410 [2022-07-14 06:39:54,215 INFO L226 Difference]: Without dead ends: 410 [2022-07-14 06:39:54,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 397 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=254, Invalid=1386, Unknown=0, NotChecked=0, Total=1640 [2022-07-14 06:39:54,216 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 582 mSDsluCounter, 1167 mSDsCounter, 0 mSdLazyCounter, 1483 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 587 SdHoareTripleChecker+Valid, 1297 SdHoareTripleChecker+Invalid, 1735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:54,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [587 Valid, 1297 Invalid, 1735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1483 Invalid, 0 Unknown, 80 Unchecked, 0.9s Time] [2022-07-14 06:39:54,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-14 06:39:54,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 261. [2022-07-14 06:39:54,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 196 states have (on average 1.4489795918367347) internal successors, (284), 225 states have internal predecessors, (284), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-14 06:39:54,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 348 transitions. [2022-07-14 06:39:54,225 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 348 transitions. Word has length 25 [2022-07-14 06:39:54,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:54,225 INFO L495 AbstractCegarLoop]: Abstraction has 261 states and 348 transitions. [2022-07-14 06:39:54,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 27 states have internal predecessors, (60), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-07-14 06:39:54,226 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 348 transitions. [2022-07-14 06:39:54,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:39:54,226 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:54,226 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:54,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2022-07-14 06:39:54,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:54,444 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:54,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:54,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361463, now seen corresponding path program 1 times [2022-07-14 06:39:54,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:54,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114842287] [2022-07-14 06:39:54,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:54,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 06:39:54,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,483 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-14 06:39:54,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:54,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114842287] [2022-07-14 06:39:54,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114842287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:54,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:54,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:54,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457042269] [2022-07-14 06:39:54,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:54,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:54,485 INFO L87 Difference]: Start difference. First operand 261 states and 348 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:54,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:54,620 INFO L93 Difference]: Finished difference Result 271 states and 340 transitions. [2022-07-14 06:39:54,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:54,621 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-14 06:39:54,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:54,622 INFO L225 Difference]: With dead ends: 271 [2022-07-14 06:39:54,622 INFO L226 Difference]: Without dead ends: 271 [2022-07-14 06:39:54,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:39:54,623 INFO L413 NwaCegarLoop]: 63 mSDtfsCounter, 159 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:54,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 195 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:54,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-07-14 06:39:54,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 258. [2022-07-14 06:39:54,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3928571428571428) internal successors, (273), 222 states have internal predecessors, (273), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-14 06:39:54,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 337 transitions. [2022-07-14 06:39:54,629 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 337 transitions. Word has length 27 [2022-07-14 06:39:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:54,629 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 337 transitions. [2022-07-14 06:39:54,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:54,629 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 337 transitions. [2022-07-14 06:39:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:39:54,630 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:54,630 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:54,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 06:39:54,630 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:54,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:54,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1195361464, now seen corresponding path program 1 times [2022-07-14 06:39:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:54,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490262316] [2022-07-14 06:39:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:39:54,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 06:39:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,714 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-14 06:39:54,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:54,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490262316] [2022-07-14 06:39:54,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490262316] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:54,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:54,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:54,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [757500268] [2022-07-14 06:39:54,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:54,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:39:54,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:54,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:39:54,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:54,716 INFO L87 Difference]: Start difference. First operand 258 states and 337 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:54,860 INFO L93 Difference]: Finished difference Result 269 states and 335 transitions. [2022-07-14 06:39:54,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:39:54,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-14 06:39:54,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:54,862 INFO L225 Difference]: With dead ends: 269 [2022-07-14 06:39:54,862 INFO L226 Difference]: Without dead ends: 269 [2022-07-14 06:39:54,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:39:54,863 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 214 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:54,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 167 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:39:54,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-07-14 06:39:54,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-07-14 06:39:54,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 196 states have (on average 1.3622448979591837) internal successors, (267), 222 states have internal predecessors, (267), 32 states have call successors, (32), 13 states have call predecessors, (32), 13 states have return successors, (32), 22 states have call predecessors, (32), 32 states have call successors, (32) [2022-07-14 06:39:54,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 331 transitions. [2022-07-14 06:39:54,871 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 331 transitions. Word has length 27 [2022-07-14 06:39:54,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:54,871 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 331 transitions. [2022-07-14 06:39:54,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:39:54,872 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 331 transitions. [2022-07-14 06:39:54,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:39:54,873 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:54,878 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] [2022-07-14 06:39:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 06:39:54,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:54,880 INFO L85 PathProgramCache]: Analyzing trace with hash 468828335, now seen corresponding path program 1 times [2022-07-14 06:39:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619092097] [2022-07-14 06:39:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:54,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 06:39:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:39:54,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:54,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619092097] [2022-07-14 06:39:54,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619092097] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:54,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:54,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:39:54,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083989354] [2022-07-14 06:39:54,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:54,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:39:54,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:54,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:39:54,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:39:54,912 INFO L87 Difference]: Start difference. First operand 258 states and 331 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:54,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:54,919 INFO L93 Difference]: Finished difference Result 267 states and 341 transitions. [2022-07-14 06:39:54,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:39:54,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-07-14 06:39:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:54,921 INFO L225 Difference]: With dead ends: 267 [2022-07-14 06:39:54,921 INFO L226 Difference]: Without dead ends: 267 [2022-07-14 06:39:54,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-14 06:39:54,921 INFO L413 NwaCegarLoop]: 125 mSDtfsCounter, 57 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:54,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:54,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-07-14 06:39:54,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 238. [2022-07-14 06:39:54,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 180 states have (on average 1.3611111111111112) internal successors, (245), 205 states have internal predecessors, (245), 30 states have call successors, (30), 11 states have call predecessors, (30), 11 states have return successors, (30), 21 states have call predecessors, (30), 30 states have call successors, (30) [2022-07-14 06:39:54,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 305 transitions. [2022-07-14 06:39:54,927 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 305 transitions. Word has length 26 [2022-07-14 06:39:54,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:54,927 INFO L495 AbstractCegarLoop]: Abstraction has 238 states and 305 transitions. [2022-07-14 06:39:54,927 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:54,927 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 305 transitions. [2022-07-14 06:39:54,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:39:54,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:54,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:54,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 06:39:54,928 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:54,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:54,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1109218320, now seen corresponding path program 1 times [2022-07-14 06:39:54,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:54,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465619207] [2022-07-14 06:39:54,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:54,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:54,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:39:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:54,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:39:54,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:54,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465619207] [2022-07-14 06:39:54,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465619207] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:39:54,971 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:39:54,971 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:39:54,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932433249] [2022-07-14 06:39:54,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:39:54,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:39:54,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:39:54,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:39:54,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:39:54,973 INFO L87 Difference]: Start difference. First operand 238 states and 305 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:54,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:39:54,988 INFO L93 Difference]: Finished difference Result 252 states and 324 transitions. [2022-07-14 06:39:54,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:39:54,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-07-14 06:39:54,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:39:54,990 INFO L225 Difference]: With dead ends: 252 [2022-07-14 06:39:54,990 INFO L226 Difference]: Without dead ends: 248 [2022-07-14 06:39:54,991 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:39:54,992 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 1 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:39:54,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 370 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:39:54,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2022-07-14 06:39:55,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 242. [2022-07-14 06:39:55,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 182 states have (on average 1.3571428571428572) internal successors, (247), 209 states have internal predecessors, (247), 30 states have call successors, (30), 11 states have call predecessors, (30), 13 states have return successors, (34), 21 states have call predecessors, (34), 30 states have call successors, (34) [2022-07-14 06:39:55,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 311 transitions. [2022-07-14 06:39:55,005 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 311 transitions. Word has length 27 [2022-07-14 06:39:55,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:39:55,005 INFO L495 AbstractCegarLoop]: Abstraction has 242 states and 311 transitions. [2022-07-14 06:39:55,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 4 states have internal predecessors, (25), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-07-14 06:39:55,005 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 311 transitions. [2022-07-14 06:39:55,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-14 06:39:55,006 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:39:55,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:39:55,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 06:39:55,007 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting is_list_containing_xErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:39:55,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:39:55,009 INFO L85 PathProgramCache]: Analyzing trace with hash -815173774, now seen corresponding path program 1 times [2022-07-14 06:39:55,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:39:55,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [938667779] [2022-07-14 06:39:55,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:55,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:39:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:55,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:39:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [938667779] [2022-07-14 06:39:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [938667779] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:39:55,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204853507] [2022-07-14 06:39:55,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:39:55,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:39:55,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:39:55,381 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:39:55,389 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:39:55,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:39:55,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 06:39:55,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:39:55,507 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 13 treesize of output 9 [2022-07-14 06:39:55,511 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 13 treesize of output 9 [2022-07-14 06:39:55,588 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:55,588 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 16 treesize of output 22 [2022-07-14 06:39:55,593 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 7 treesize of output 3 [2022-07-14 06:39:55,605 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:55,605 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 16 treesize of output 22 [2022-07-14 06:39:55,611 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 7 treesize of output 3 [2022-07-14 06:39:55,659 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:55,659 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 20 treesize of output 26 [2022-07-14 06:39:55,686 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:39:55,686 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 20 treesize of output 26 [2022-07-14 06:39:55,713 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:39:55,713 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 30 [2022-07-14 06:39:55,731 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:39:55,731 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 30 [2022-07-14 06:39:55,849 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:39:55,849 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-14 06:39:55,855 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-14 06:39:55,948 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 23 treesize of output 25 [2022-07-14 06:39:55,958 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-14 06:39:55,999 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 32 [2022-07-14 06:39:56,017 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 23 treesize of output 25 [2022-07-14 06:39:56,076 INFO L356 Elim1Store]: treesize reduction 26, result has 45.8 percent of original size [2022-07-14 06:39:56,076 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 44 [2022-07-14 06:39:56,087 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:39:56,087 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 30 treesize of output 33 [2022-07-14 06:39:56,605 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 33 treesize of output 17 [2022-07-14 06:39:56,609 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 15 treesize of output 7 [2022-07-14 06:39:56,697 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:39:56,697 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:39:57,356 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 132 treesize of output 108 [2022-07-14 06:39:58,134 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:39:58,135 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 13 treesize of output 12 [2022-07-14 06:40:02,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (and (<= .cse0 0) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse0 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= .cse0 0) (= .cse1 0)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-14 06:40:07,533 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (select (let ((.cse6 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse1 (select (select (let ((.cse2 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse2 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (and (<= .cse0 0) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse0 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (and (= .cse0 0) (= .cse1 0)))))) is different from false [2022-07-14 06:40:09,016 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse3 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse4 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse0 (select (store (select (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse5 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse5 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 0) .cse4)) (.cse1 (select (store (select (store (let ((.cse2 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse2 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse4))) (or (and (= .cse0 0) (= .cse1 0)) (and (<= .cse0 0) (<= 0 (+ .cse0 4)) (= .cse1 |v_ULTIMATE.start_main_~n~0#1.base_21|)) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-07-14 06:40:09,027 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:09,027 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 270 treesize of output 220 [2022-07-14 06:40:09,032 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:09,053 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 231 treesize of output 223 [2022-07-14 06:40:09,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:09,060 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 215 treesize of output 185 [2022-07-14 06:40:09,080 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:09,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 191 treesize of output 185 [2022-07-14 06:40:09,085 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 205 treesize of output 197 [2022-07-14 06:40:09,090 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 212 treesize of output 200 [2022-07-14 06:40:09,097 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 211 treesize of output 195 [2022-07-14 06:40:09,102 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 147 treesize of output 135 [2022-07-14 06:40:09,119 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-14 06:40:09,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204853507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:40:09,120 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:40:09,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 18, 20] total 49 [2022-07-14 06:40:09,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463138303] [2022-07-14 06:40:09,120 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:09,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-14 06:40:09,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:09,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-14 06:40:09,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1998, Unknown=6, NotChecked=276, Total=2450 [2022-07-14 06:40:09,121 INFO L87 Difference]: Start difference. First operand 242 states and 311 transitions. Second operand has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:09,156 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (<= 8 .cse0) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse6 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select (store (select (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse7 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse7 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 0) .cse6)) (.cse3 (select (store (select (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|) .cse6))) (or (and (= .cse2 0) (= .cse3 0)) (and (<= .cse2 0) (<= 0 (+ .cse2 4)) (= .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|)) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~#list~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0))) is different from false [2022-07-14 06:40:09,161 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (and (<= .cse0 8) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1)) (<= 8 .cse0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse1) 0) (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|) (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse5 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse7 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select (select (let ((.cse8 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7)) (.cse3 (select (select (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse4 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse4 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse7))) (or (and (<= .cse2 0) (= .cse3 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse2 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (and (= .cse2 0) (= .cse3 0)))))) (= |c_ULTIMATE.start_main_~tail~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |c_ULTIMATE.start_main_~tail~0#1.offset| 0))) is different from false [2022-07-14 06:40:11,184 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4)) (.cse1 (= |c_ULTIMATE.start_main_~tail~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (.cse2 (= |c_ULTIMATE.start_main_~n~0#1.offset| 0))) (and (or (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |c_ULTIMATE.start_main_~#list~0#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_main_~tail~0#1.base|))) (and (<= 8 .cse0) .cse1 .cse2 (<= .cse0 8)))) (= 0 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3)) (= (+ |c_ULTIMATE.start_main_~#list~0#1.offset| (* |c_ULTIMATE.start_main_~tail~0#1.offset| (- 1))) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#list~0#1.base|) .cse3) 0) .cse1 (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) .cse2 (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((|ULTIMATE.start_main_~tail~0#1.offset| Int) (|v_ULTIMATE.start_main_~n~0#1.base_21| Int) (v_ArrVal_861 (Array Int Int)) (v_ArrVal_860 (Array Int Int)) (v_ArrVal_852 (Array Int Int)) (v_ArrVal_854 Int) (v_ArrVal_851 (Array Int Int))) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4)) (.cse9 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse4 (select (select (let ((.cse10 (store (let ((.cse11 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_852))) (store .cse11 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse11 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_854))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_861))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9)) (.cse5 (select (select (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_851))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |ULTIMATE.start_main_~n~0#1.base|))) |v_ULTIMATE.start_main_~n~0#1.base_21| v_ArrVal_860))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_21|))) |c_ULTIMATE.start_main_~#list~0#1.base|) .cse9))) (or (and (<= .cse4 0) (= .cse5 |v_ULTIMATE.start_main_~n~0#1.base_21|) (<= 0 (+ .cse4 4))) (= |v_ULTIMATE.start_main_~n~0#1.base_21| |c_ULTIMATE.start_main_~tail~0#1.base|) (and (= .cse4 0) (= .cse5 0)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))))) is different from false [2022-07-14 06:40:15,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:15,618 INFO L93 Difference]: Finished difference Result 721 states and 912 transitions. [2022-07-14 06:40:15,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-14 06:40:15,619 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-14 06:40:15,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:15,621 INFO L225 Difference]: With dead ends: 721 [2022-07-14 06:40:15,621 INFO L226 Difference]: Without dead ends: 721 [2022-07-14 06:40:15,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 23 SyntacticMatches, 12 SemanticMatches, 90 ConstructedPredicates, 6 IntricatePredicates, 2 DeprecatedPredicates, 2029 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=636, Invalid=6688, Unknown=10, NotChecked=1038, Total=8372 [2022-07-14 06:40:15,622 INFO L413 NwaCegarLoop]: 191 mSDtfsCounter, 1052 mSDsluCounter, 2414 mSDsCounter, 0 mSdLazyCounter, 3118 mSolverCounterSat, 267 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1072 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 5540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 267 IncrementalHoareTripleChecker+Valid, 3118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2155 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:15,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1072 Valid, 2605 Invalid, 5540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [267 Valid, 3118 Invalid, 0 Unknown, 2155 Unchecked, 1.8s Time] [2022-07-14 06:40:15,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 721 states. [2022-07-14 06:40:15,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 721 to 327. [2022-07-14 06:40:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 327 states, 252 states have (on average 1.3492063492063493) internal successors, (340), 283 states have internal predecessors, (340), 40 states have call successors, (40), 15 states have call predecessors, (40), 18 states have return successors, (46), 28 states have call predecessors, (46), 40 states have call successors, (46) [2022-07-14 06:40:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 426 transitions. [2022-07-14 06:40:15,637 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 426 transitions. Word has length 28 [2022-07-14 06:40:15,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:15,637 INFO L495 AbstractCegarLoop]: Abstraction has 327 states and 426 transitions. [2022-07-14 06:40:15,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.608695652173913) internal successors, (74), 44 states have internal predecessors, (74), 6 states have call successors, (6), 6 states have call predecessors, (6), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:40:15,638 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 426 transitions. [2022-07-14 06:40:15,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:40:15,639 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:15,639 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:15,661 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:15,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:15,859 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:15,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:15,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1709630296, now seen corresponding path program 1 times [2022-07-14 06:40:15,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:15,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673668403] [2022-07-14 06:40:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:15,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:40:16,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:16,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:16,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673668403] [2022-07-14 06:40:16,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673668403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:16,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706074256] [2022-07-14 06:40:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:16,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:16,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:16,051 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:40:16,052 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:40:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:16,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-14 06:40:16,143 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:16,217 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 13 treesize of output 9 [2022-07-14 06:40:16,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:16,323 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 20 treesize of output 20 [2022-07-14 06:40:16,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:16,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:16,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706074256] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:16,455 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:40:16,455 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2022-07-14 06:40:16,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492246449] [2022-07-14 06:40:16,455 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-14 06:40:16,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:16,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-14 06:40:16,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2022-07-14 06:40:16,456 INFO L87 Difference]: Start difference. First operand 327 states and 426 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:16,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:16,924 INFO L93 Difference]: Finished difference Result 348 states and 448 transitions. [2022-07-14 06:40:16,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-14 06:40:16,924 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-07-14 06:40:16,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:16,925 INFO L225 Difference]: With dead ends: 348 [2022-07-14 06:40:16,925 INFO L226 Difference]: Without dead ends: 347 [2022-07-14 06:40:16,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=167, Invalid=889, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:40:16,926 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 252 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 434 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:16,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 683 Invalid, 434 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 283 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2022-07-14 06:40:16,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2022-07-14 06:40:16,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 308. [2022-07-14 06:40:16,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.3487394957983194) internal successors, (321), 267 states have internal predecessors, (321), 36 states have call successors, (36), 14 states have call predecessors, (36), 17 states have return successors, (42), 26 states have call predecessors, (42), 36 states have call successors, (42) [2022-07-14 06:40:16,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 399 transitions. [2022-07-14 06:40:16,932 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 399 transitions. Word has length 27 [2022-07-14 06:40:16,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:16,932 INFO L495 AbstractCegarLoop]: Abstraction has 308 states and 399 transitions. [2022-07-14 06:40:16,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 399 transitions. [2022-07-14 06:40:16,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:40:16,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:16,933 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:16,952 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:17,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 06:40:17,147 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:17,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,147 INFO L85 PathProgramCache]: Analyzing trace with hash -1952238210, now seen corresponding path program 1 times [2022-07-14 06:40:17,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2014131239] [2022-07-14 06:40:17,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:40:17,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 06:40:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-14 06:40:17,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,169 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2014131239] [2022-07-14 06:40:17,169 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2014131239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,169 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,169 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:40:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499436463] [2022-07-14 06:40:17,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:40:17,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:40:17,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:40:17,171 INFO L87 Difference]: Start difference. First operand 308 states and 399 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,194 INFO L93 Difference]: Finished difference Result 317 states and 400 transitions. [2022-07-14 06:40:17,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:40:17,194 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-14 06:40:17,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,196 INFO L225 Difference]: With dead ends: 317 [2022-07-14 06:40:17,196 INFO L226 Difference]: Without dead ends: 317 [2022-07-14 06:40:17,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:40:17,196 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 38 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 253 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:40:17,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-07-14 06:40:17,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2022-07-14 06:40:17,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 237 states have (on average 1.3459915611814346) internal successors, (319), 265 states have internal predecessors, (319), 34 states have call successors, (34), 14 states have call predecessors, (34), 17 states have return successors, (40), 25 states have call predecessors, (40), 34 states have call successors, (40) [2022-07-14 06:40:17,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 393 transitions. [2022-07-14 06:40:17,212 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 393 transitions. Word has length 30 [2022-07-14 06:40:17,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,212 INFO L495 AbstractCegarLoop]: Abstraction has 305 states and 393 transitions. [2022-07-14 06:40:17,213 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 393 transitions. [2022-07-14 06:40:17,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-14 06:40:17,213 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,214 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:17,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 06:40:17,214 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:17,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1439567607, now seen corresponding path program 1 times [2022-07-14 06:40:17,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [329724333] [2022-07-14 06:40:17,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:40:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 06:40:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,318 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-14 06:40:17,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [329724333] [2022-07-14 06:40:17,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [329724333] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 06:40:17,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127943298] [2022-07-14 06:40:17,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:40:17,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:40:17,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:40:17,319 INFO L87 Difference]: Start difference. First operand 305 states and 393 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,459 INFO L93 Difference]: Finished difference Result 323 states and 414 transitions. [2022-07-14 06:40:17,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 06:40:17,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2022-07-14 06:40:17,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,460 INFO L225 Difference]: With dead ends: 323 [2022-07-14 06:40:17,460 INFO L226 Difference]: Without dead ends: 323 [2022-07-14 06:40:17,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:40:17,460 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 119 mSDsluCounter, 285 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 368 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2022-07-14 06:40:17,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 311. [2022-07-14 06:40:17,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 242 states have (on average 1.3388429752066116) internal successors, (324), 270 states have internal predecessors, (324), 35 states have call successors, (35), 14 states have call predecessors, (35), 17 states have return successors, (41), 26 states have call predecessors, (41), 35 states have call successors, (41) [2022-07-14 06:40:17,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 400 transitions. [2022-07-14 06:40:17,465 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 400 transitions. Word has length 30 [2022-07-14 06:40:17,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,465 INFO L495 AbstractCegarLoop]: Abstraction has 311 states and 400 transitions. [2022-07-14 06:40:17,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,465 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 400 transitions. [2022-07-14 06:40:17,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:40:17,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,466 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:17,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 06:40:17,466 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:17,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,466 INFO L85 PathProgramCache]: Analyzing trace with hash 453625093, now seen corresponding path program 1 times [2022-07-14 06:40:17,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37530862] [2022-07-14 06:40:17,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 06:40:17,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 06:40:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,519 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-14 06:40:17,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37530862] [2022-07-14 06:40:17,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37530862] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:40:17,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:40:17,520 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:40:17,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554080189] [2022-07-14 06:40:17,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:40:17,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:40:17,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:17,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:40:17,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:40:17,521 INFO L87 Difference]: Start difference. First operand 311 states and 400 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:17,652 INFO L93 Difference]: Finished difference Result 348 states and 445 transitions. [2022-07-14 06:40:17,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:40:17,653 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 32 [2022-07-14 06:40:17,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:17,654 INFO L225 Difference]: With dead ends: 348 [2022-07-14 06:40:17,654 INFO L226 Difference]: Without dead ends: 348 [2022-07-14 06:40:17,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:40:17,654 INFO L413 NwaCegarLoop]: 85 mSDtfsCounter, 83 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:17,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 365 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:40:17,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2022-07-14 06:40:17,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 330. [2022-07-14 06:40:17,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.3307392996108949) internal successors, (342), 286 states have internal predecessors, (342), 39 states have call successors, (39), 14 states have call predecessors, (39), 17 states have return successors, (45), 29 states have call predecessors, (45), 39 states have call successors, (45) [2022-07-14 06:40:17,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 426 transitions. [2022-07-14 06:40:17,659 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 426 transitions. Word has length 32 [2022-07-14 06:40:17,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:17,660 INFO L495 AbstractCegarLoop]: Abstraction has 330 states and 426 transitions. [2022-07-14 06:40:17,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:17,660 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 426 transitions. [2022-07-14 06:40:17,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-14 06:40:17,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:17,660 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:17,660 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 06:40:17,660 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:17,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1579548114, now seen corresponding path program 1 times [2022-07-14 06:40:17,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:17,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999440179] [2022-07-14 06:40:17,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 06:40:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:17,927 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:17,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:17,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999440179] [2022-07-14 06:40:17,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999440179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:17,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048214382] [2022-07-14 06:40:17,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:17,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:17,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:17,946 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:40:17,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:40:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:18,039 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-14 06:40:18,041 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:18,057 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-14 06:40:18,061 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-14 06:40:18,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,084 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 21 treesize of output 20 [2022-07-14 06:40:18,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,089 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 21 treesize of output 20 [2022-07-14 06:40:18,159 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,160 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-14 06:40:18,164 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,175 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-14 06:40:18,186 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,188 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-14 06:40:18,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,196 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-14 06:40:18,204 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-14 06:40:18,207 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-14 06:40:18,383 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-14 06:40:18,383 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 41 treesize of output 40 [2022-07-14 06:40:18,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:40:18,387 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 20 treesize of output 22 [2022-07-14 06:40:18,397 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 15 treesize of output 7 [2022-07-14 06:40:18,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:18,400 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2022-07-14 06:40:18,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:18,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:18,414 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_#t~mem4#1.base| v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-14 06:40:18,421 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1075 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1075) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0)) (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_remove_~x#1.base|) (+ |c_ULTIMATE.start_remove_~x#1.offset| 4)) v_ArrVal_1074) |c_ULTIMATE.start_remove_~x#1.base|) |c_ULTIMATE.start_remove_~x#1.offset|) 0))) is different from false [2022-07-14 06:40:18,432 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1074 (Array Int Int))) (= (select (select (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| 4)) v_ArrVal_1074) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0)) (forall ((v_ArrVal_1075 (Array Int Int))) (= (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| 4)) v_ArrVal_1075) |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) 0))) is different from false [2022-07-14 06:40:18,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048214382] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:18,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-14 06:40:18,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 20 [2022-07-14 06:40:18,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241092700] [2022-07-14 06:40:18,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-14 06:40:18,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-14 06:40:18,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:40:18,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-14 06:40:18,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=323, Unknown=3, NotChecked=114, Total=506 [2022-07-14 06:40:18,444 INFO L87 Difference]: Start difference. First operand 330 states and 426 transitions. Second operand has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:19,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:40:19,116 INFO L93 Difference]: Finished difference Result 384 states and 487 transitions. [2022-07-14 06:40:19,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 06:40:19,117 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2022-07-14 06:40:19,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:40:19,118 INFO L225 Difference]: With dead ends: 384 [2022-07-14 06:40:19,118 INFO L226 Difference]: Without dead ends: 384 [2022-07-14 06:40:19,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=705, Unknown=3, NotChecked=174, Total=1056 [2022-07-14 06:40:19,119 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 361 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 369 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:40:19,119 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [369 Valid, 1052 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 805 Invalid, 0 Unknown, 75 Unchecked, 0.4s Time] [2022-07-14 06:40:19,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2022-07-14 06:40:19,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 320. [2022-07-14 06:40:19,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 320 states, 248 states have (on average 1.3266129032258065) internal successors, (329), 277 states have internal predecessors, (329), 38 states have call successors, (38), 14 states have call predecessors, (38), 17 states have return successors, (44), 28 states have call predecessors, (44), 38 states have call successors, (44) [2022-07-14 06:40:19,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 411 transitions. [2022-07-14 06:40:19,128 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 411 transitions. Word has length 31 [2022-07-14 06:40:19,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:40:19,128 INFO L495 AbstractCegarLoop]: Abstraction has 320 states and 411 transitions. [2022-07-14 06:40:19,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.65) internal successors, (53), 20 states have internal predecessors, (53), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-07-14 06:40:19,129 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 411 transitions. [2022-07-14 06:40:19,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-14 06:40:19,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:40:19,129 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:40:19,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-14 06:40:19,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 06:40:19,343 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting is_list_containing_xErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 41 more)] === [2022-07-14 06:40:19,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:40:19,344 INFO L85 PathProgramCache]: Analyzing trace with hash -575773780, now seen corresponding path program 1 times [2022-07-14 06:40:19,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:40:19,344 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059458588] [2022-07-14 06:40:19,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:19,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:40:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:19,589 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:19,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:40:19,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059458588] [2022-07-14 06:40:19,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059458588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:40:19,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2119380068] [2022-07-14 06:40:19,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:40:19,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:40:19,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:40:19,591 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:40:19,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:40:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:40:19,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 89 conjunts are in the unsatisfiable core [2022-07-14 06:40:19,712 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:40:19,723 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 13 treesize of output 9 [2022-07-14 06:40:19,728 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 13 treesize of output 9 [2022-07-14 06:40:19,816 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:19,816 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 16 treesize of output 22 [2022-07-14 06:40:19,819 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 7 treesize of output 3 [2022-07-14 06:40:19,836 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:19,836 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 16 treesize of output 22 [2022-07-14 06:40:19,841 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 7 treesize of output 3 [2022-07-14 06:40:19,889 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:19,890 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 20 treesize of output 26 [2022-07-14 06:40:19,908 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:40:19,908 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 20 treesize of output 26 [2022-07-14 06:40:19,931 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:40:19,931 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 30 [2022-07-14 06:40:19,949 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:40:19,949 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 30 [2022-07-14 06:40:20,044 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-14 06:40:20,044 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-14 06:40:20,125 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 23 treesize of output 25 [2022-07-14 06:40:20,134 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 23 treesize of output 25 [2022-07-14 06:40:20,152 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 30 treesize of output 29 [2022-07-14 06:40:20,163 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 30 treesize of output 29 [2022-07-14 06:40:20,233 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:40:20,233 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 43 [2022-07-14 06:40:20,246 INFO L356 Elim1Store]: treesize reduction 23, result has 36.1 percent of original size [2022-07-14 06:40:20,246 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 49 [2022-07-14 06:40:21,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:40:21,644 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-14 06:40:21,644 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 65 treesize of output 41 [2022-07-14 06:40:21,650 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:21,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2022-07-14 06:40:21,673 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 8 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:40:21,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:40:22,250 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:22,251 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 271 treesize of output 239 [2022-07-14 06:40:22,256 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:40:22,256 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 199 [2022-07-14 06:40:24,190 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-14 06:40:24,190 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 13 treesize of output 12 [2022-07-14 06:40:43,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~n~0#1.base| Int)) (or (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) (.cse4 (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_24|)))) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_3 4) 0)) (and (= .cse0 0) (= .cse1 0)) (let ((.cse3 (+ .cse0 4))) (and (= 0 (select (select .cse2 .cse1) .cse3)) (= 0 (select (select .cse4 .cse1) .cse3)))) (not (= (select v_arrayElimArr_4 4) 0)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|)))))) (and (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)))) is different from false [2022-07-14 06:41:01,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse7 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse2 (let ((.cse9 (store (let ((.cse10 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse10 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (store .cse9 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 0)))) (.cse4 (let ((.cse6 (store (let ((.cse8 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse8 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse8 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3))) (store .cse6 |c_ULTIMATE.start_main_~tail~0#1.base| (store (select .cse6 |c_ULTIMATE.start_main_~tail~0#1.base|) .cse7 |v_ULTIMATE.start_main_~n~0#1.base_24|)))) (.cse5 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse1 (select (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5)) (.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse5))) (or (not (= (select v_arrayElimArr_3 4) 0)) (and (= .cse0 0) (= .cse1 0)) (let ((.cse3 (+ .cse0 4))) (and (= 0 (select (select .cse2 .cse1) .cse3)) (= 0 (select (select .cse4 .cse1) .cse3)))) (not (= (select v_arrayElimArr_4 4) 0)) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~tail~0#1.base|)))))) is different from false [2022-07-14 06:41:05,599 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1194 Int) (|v_ULTIMATE.start_main_~n~0#1.base_24| Int) (|ULTIMATE.start_main_~tail~0#1.offset| Int) (v_ArrVal_1191 (Array Int Int)) (v_ArrVal_1190 (Array Int Int)) (|ULTIMATE.start_main_~n~0#1.base| Int) (v_arrayElimArr_4 (Array Int Int)) (v_arrayElimArr_3 (Array Int Int)) (v_ArrVal_1192 Int)) (let ((.cse8 (+ |ULTIMATE.start_main_~tail~0#1.offset| 4))) (let ((.cse0 (store (let ((.cse10 (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1191))) (store .cse10 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse10 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_ArrVal_1192))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_3)) (.cse4 (store (let ((.cse9 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base| v_ArrVal_1190))) (store .cse9 |c_ULTIMATE.start_main_~#list~0#1.base| (store (select .cse9 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 v_ArrVal_1194))) |v_ULTIMATE.start_main_~n~0#1.base_24| v_arrayElimArr_4))) (let ((.cse5 (store (select .cse4 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 0)) (.cse1 (store (select .cse0 |c_ULTIMATE.start_main_~#list~0#1.base|) .cse8 |v_ULTIMATE.start_main_~n~0#1.base_24|)) (.cse7 (+ |c_ULTIMATE.start_main_~#list~0#1.offset| 4))) (let ((.cse2 (select .cse1 .cse7)) (.cse6 (select .cse5 .cse7))) (or (let ((.cse3 (+ .cse6 4))) (and (= (select (select (store .cse0 |c_ULTIMATE.start_main_~#list~0#1.base| .cse1) .cse2) .cse3) 0) (= (select (select (store .cse4 |c_ULTIMATE.start_main_~#list~0#1.base| .cse5) .cse2) .cse3) 0))) (not (= (select v_arrayElimArr_3 4) 0)) (not (= (select v_arrayElimArr_4 4) 0)) (and (= .cse2 0) (= .cse6 0)) (and (= |c_ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~#list~0#1.base|)) (= |v_ULTIMATE.start_main_~n~0#1.base_24| |c_ULTIMATE.start_main_~#list~0#1.base|))))))) is different from false [2022-07-14 06:41:05,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,611 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 503 treesize of output 413 [2022-07-14 06:41:05,614 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:41:05,638 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,639 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 35168 treesize of output 34269 [2022-07-14 06:41:05,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,709 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 34206 treesize of output 26396 [2022-07-14 06:41:05,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:41:05,806 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:05,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 96759 treesize of output 92627 [2022-07-14 06:41:06,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:06,088 INFO L356 Elim1Store]: treesize reduction 21, result has 58.8 percent of original size [2022-07-14 06:41:06,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 123507 treesize of output 113818 [2022-07-14 06:41:08,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:08,406 INFO L356 Elim1Store]: treesize reduction 21, result has 58.8 percent of original size [2022-07-14 06:41:08,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 138253 treesize of output 126966 [2022-07-14 06:41:12,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:12,949 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:12,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 105946 treesize of output 102891 [2022-07-14 06:41:16,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:41:16,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:41:16,401 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 97538 treesize of output 95923