./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c 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/array-memsafety/openbsd_cstpcpy-alloca-1.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 f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:22:32,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:22:32,277 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:22:32,319 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:22:32,320 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:22:32,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:22:32,323 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:22:32,327 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:22:32,329 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:22:32,330 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:22:32,331 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:22:32,332 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:22:32,334 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:22:32,336 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:22:32,337 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:22:32,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:22:32,340 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:22:32,344 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:22:32,346 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:22:32,349 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:22:32,352 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:22:32,353 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:22:32,354 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:22:32,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:22:32,357 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:22:32,360 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:22:32,363 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:22:32,364 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:22:32,365 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:22:32,366 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:22:32,367 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:22:32,368 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:22:32,369 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:22:32,370 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:22:32,371 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:22:32,372 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:22:32,372 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:22:32,372 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:22:32,373 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:22:32,374 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:22:32,375 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:22:32,376 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:22:32,377 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:22:32,415 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:22:32,415 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:22:32,415 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:22:32,416 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:22:32,416 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:22:32,417 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:22:32,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:22:32,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:22:32,417 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:22:32,418 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:22:32,419 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:22:32,419 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:22:32,419 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:22:32,419 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:22:32,419 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:22:32,420 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:22:32,420 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:22:32,420 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:22:32,420 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:22:32,420 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:22:32,421 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:22:32,421 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:22:32,421 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:22:32,421 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:22:32,421 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:22:32,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:22:32,422 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:22:32,422 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:22:32,422 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:22:32,422 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:22:32,423 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 -> f22afdea3888c472e42c0b4bee511704d4ceb9c1e2d9f4db0ce5ffbd6de758f0 [2022-07-12 18:22:32,687 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:22:32,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:22:32,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:22:32,711 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:22:32,712 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:22:32,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2022-07-12 18:22:32,772 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0002a2b3/8a47d6597797499a8a50c6749eea7be7/FLAGc425edd52 [2022-07-12 18:22:33,230 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:22:33,231 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpcpy-alloca-1.i [2022-07-12 18:22:33,244 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0002a2b3/8a47d6597797499a8a50c6749eea7be7/FLAGc425edd52 [2022-07-12 18:22:33,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b0002a2b3/8a47d6597797499a8a50c6749eea7be7 [2022-07-12 18:22:33,591 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:22:33,593 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:22:33,596 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:33,596 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:22:33,599 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:22:33,599 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:33,600 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39ff4ab3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33, skipping insertion in model container [2022-07-12 18:22:33,600 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:33,607 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:22:33,647 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:22:33,893 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:33,900 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:22:33,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:22:33,959 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:22:33,960 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33 WrapperNode [2022-07-12 18:22:33,960 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:22:33,960 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:22:33,961 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:22:33,961 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:22:33,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:33,979 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:33,996 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 64 [2022-07-12 18:22:33,996 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:22:33,997 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:22:33,997 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:22:33,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:22:34,003 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,003 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,007 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,008 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,013 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,019 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,021 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,022 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:22:34,023 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:22:34,023 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:22:34,024 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:22:34,030 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (1/1) ... [2022-07-12 18:22:34,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:22:34,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:34,061 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-12 18:22:34,090 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-12 18:22:34,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:22:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:22:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:22:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:22:34,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:22:34,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:22:34,202 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:22:34,203 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:22:34,398 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:22:34,404 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:22:34,404 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-12 18:22:34,406 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:22:34 BoogieIcfgContainer [2022-07-12 18:22:34,418 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:22:34,420 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:22:34,421 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:22:34,424 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:22:34,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:22:33" (1/3) ... [2022-07-12 18:22:34,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cb7e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:22:34, skipping insertion in model container [2022-07-12 18:22:34,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:22:33" (2/3) ... [2022-07-12 18:22:34,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74cb7e8e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:22:34, skipping insertion in model container [2022-07-12 18:22:34,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:22:34" (3/3) ... [2022-07-12 18:22:34,426 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpcpy-alloca-1.i [2022-07-12 18:22:34,439 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:22:34,455 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-12 18:22:34,516 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:22:34,536 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@58c49b9b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@43aa60ba [2022-07-12 18:22:34,536 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-12 18:22:34,552 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:34,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:22:34,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:34,574 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:22:34,575 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:34,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:34,580 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-12 18:22:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:34,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696292474] [2022-07-12 18:22:34,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:34,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:34,784 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-12 18:22:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:34,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696292474] [2022-07-12 18:22:34,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696292474] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:34,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:34,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:34,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623297120] [2022-07-12 18:22:34,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:34,795 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:34,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:34,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:34,827 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 18:22:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:34,895 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-12 18:22:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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 6 [2022-07-12 18:22:34,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:34,905 INFO L225 Difference]: With dead ends: 34 [2022-07-12 18:22:34,905 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:22:34,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:34,912 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:34,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:22:34,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-12 18:22:34,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:34,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-12 18:22:34,948 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-12 18:22:34,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:34,949 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-12 18:22:34,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 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-12 18:22:34,950 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-12 18:22:34,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-12 18:22:34,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:34,951 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-12 18:22:34,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:22:34,952 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:34,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:34,954 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-12 18:22:34,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:34,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833447975] [2022-07-12 18:22:34,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:34,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:34,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,000 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-12 18:22:35,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:35,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833447975] [2022-07-12 18:22:35,002 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833447975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:35,002 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:35,002 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:35,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [4862796] [2022-07-12 18:22:35,003 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:35,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:35,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:35,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:35,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:35,006 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 18:22:35,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,032 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-12 18:22:35,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:35,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-07-12 18:22:35,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,034 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:22:35,034 INFO L226 Difference]: Without dead ends: 28 [2022-07-12 18:22:35,035 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-12 18:22:35,039 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 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-12 18:22:35,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:35,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-12 18:22:35,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-12 18:22:35,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 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-12 18:22:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-12 18:22:35,049 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-12 18:22:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,049 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-12 18:22:35,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-12 18:22:35,050 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-12 18:22:35,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:22:35,051 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,052 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:22:35,053 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:35,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:35,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-12 18:22:35,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:35,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847151899] [2022-07-12 18:22:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:35,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,159 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-12 18:22:35,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:35,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847151899] [2022-07-12 18:22:35,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847151899] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:35,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:35,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:35,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473667688] [2022-07-12 18:22:35,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:35,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:35,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:35,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:35,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:35,164 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12 18:22:35,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,195 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-07-12 18:22:35,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:35,196 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-07-12 18:22:35,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,197 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:22:35,197 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 18:22:35,197 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:35,198 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 34 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:35,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 41 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 18:22:35,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-07-12 18:22:35,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.631578947368421) internal successors, (31), 27 states have internal predecessors, (31), 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-12 18:22:35,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2022-07-12 18:22:35,203 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 7 [2022-07-12 18:22:35,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,204 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2022-07-12 18:22:35,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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-12 18:22:35,204 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2022-07-12 18:22:35,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:22:35,206 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,206 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:22:35,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:35,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:35,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033068, now seen corresponding path program 1 times [2022-07-12 18:22:35,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:35,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507517257] [2022-07-12 18:22:35,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:35,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,253 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-12 18:22:35,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:35,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507517257] [2022-07-12 18:22:35,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507517257] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:35,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:35,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:22:35,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357721566] [2022-07-12 18:22:35,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:35,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:22:35,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:35,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:22:35,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:22:35,256 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:22:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,274 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2022-07-12 18:22:35,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:22:35,274 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2022-07-12 18:22:35,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,275 INFO L225 Difference]: With dead ends: 26 [2022-07-12 18:22:35,275 INFO L226 Difference]: Without dead ends: 26 [2022-07-12 18:22:35,275 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-12 18:22:35,276 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:35,277 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:35,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-07-12 18:22:35,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-07-12 18:22:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 25 states have internal predecessors, (29), 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-12 18:22:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-12 18:22:35,280 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-12 18:22:35,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,281 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-12 18:22:35,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-12 18:22:35,281 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-12 18:22:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:22:35,282 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,282 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:22:35,282 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-12 18:22:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:35,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725219705] [2022-07-12 18:22:35,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:35,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,369 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-12 18:22:35,370 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:35,370 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725219705] [2022-07-12 18:22:35,370 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725219705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:35,370 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:35,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:35,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668408057] [2022-07-12 18:22:35,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:35,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:22:35,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:35,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:22:35,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:35,372 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-12 18:22:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,406 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-12 18:22:35,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:35,406 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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 7 [2022-07-12 18:22:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,407 INFO L225 Difference]: With dead ends: 29 [2022-07-12 18:22:35,407 INFO L226 Difference]: Without dead ends: 29 [2022-07-12 18:22:35,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:35,409 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:35,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 47 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:35,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-12 18:22:35,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-07-12 18:22:35,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 20 states have (on average 1.5) internal successors, (30), 26 states have internal predecessors, (30), 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-12 18:22:35,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-12 18:22:35,412 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 7 [2022-07-12 18:22:35,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,413 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-12 18:22:35,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 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-12 18:22:35,413 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-12 18:22:35,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:22:35,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,414 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:22:35,414 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:35,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:35,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1762264955, now seen corresponding path program 1 times [2022-07-12 18:22:35,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:35,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578840137] [2022-07-12 18:22:35,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:35,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,529 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-12 18:22:35,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:35,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [578840137] [2022-07-12 18:22:35,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [578840137] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:35,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [310961695] [2022-07-12 18:22:35,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:35,531 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:35,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:35,536 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-12 18:22:35,538 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-12 18:22:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:35,589 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-07-12 18:22:35,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:35,688 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-12 18:22:35,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:35,741 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 23 treesize of output 19 [2022-07-12 18:22:35,791 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-12 18:22:35,792 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [310961695] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:35,792 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:35,792 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2022-07-12 18:22:35,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421661599] [2022-07-12 18:22:35,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:35,793 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:22:35,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:35,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:22:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:35,794 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-12 18:22:35,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:35,921 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-07-12 18:22:35,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:22:35,922 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:22:35,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:35,923 INFO L225 Difference]: With dead ends: 48 [2022-07-12 18:22:35,923 INFO L226 Difference]: Without dead ends: 48 [2022-07-12 18:22:35,924 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:22:35,928 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 65 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:35,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 98 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:35,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-12 18:22:35,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 34. [2022-07-12 18:22:35,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 33 states have internal predecessors, (38), 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-12 18:22:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-07-12 18:22:35,938 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 11 [2022-07-12 18:22:35,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:35,939 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-07-12 18:22:35,939 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.7777777777777777) internal successors, (25), 10 states have internal predecessors, (25), 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-12 18:22:35,939 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-07-12 18:22:35,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:22:35,940 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:35,940 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:35,966 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-12 18:22:36,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-07-12 18:22:36,160 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash 952918329, now seen corresponding path program 1 times [2022-07-12 18:22:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544049788] [2022-07-12 18:22:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:36,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:36,289 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-12 18:22:36,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:36,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544049788] [2022-07-12 18:22:36,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544049788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:36,292 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931502764] [2022-07-12 18:22:36,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:36,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:36,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:36,296 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-12 18:22:36,311 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-12 18:22:36,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:36,360 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-12 18:22:36,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:36,450 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-12 18:22:36,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:36,479 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 23 treesize of output 19 [2022-07-12 18:22:36,560 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-12 18:22:36,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931502764] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:36,560 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:36,561 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-07-12 18:22:36,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272913177] [2022-07-12 18:22:36,561 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:36,561 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-12 18:22:36,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:36,562 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-12 18:22:36,562 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:22:36,562 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 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-12 18:22:36,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:36,761 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2022-07-12 18:22:36,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:22:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:22:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:36,764 INFO L225 Difference]: With dead ends: 76 [2022-07-12 18:22:36,764 INFO L226 Difference]: Without dead ends: 76 [2022-07-12 18:22:36,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=162, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:22:36,765 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 191 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:36,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [191 Valid, 102 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:36,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-07-12 18:22:36,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 35. [2022-07-12 18:22:36,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 34 states have internal predecessors, (40), 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-12 18:22:36,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2022-07-12 18:22:36,768 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 11 [2022-07-12 18:22:36,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:36,769 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2022-07-12 18:22:36,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 12 states have internal predecessors, (26), 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-12 18:22:36,769 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2022-07-12 18:22:36,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:22:36,769 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:36,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:36,796 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-12 18:22:36,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2022-07-12 18:22:36,970 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:36,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:36,971 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976699, now seen corresponding path program 1 times [2022-07-12 18:22:36,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:36,971 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101555666] [2022-07-12 18:22:36,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:36,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:36,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,048 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-12 18:22:37,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:37,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101555666] [2022-07-12 18:22:37,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101555666] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:37,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:37,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:22:37,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405489107] [2022-07-12 18:22:37,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:37,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:22:37,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:37,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:22:37,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:37,051 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:37,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:37,095 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2022-07-12 18:22:37,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:22:37,096 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:22:37,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:37,096 INFO L225 Difference]: With dead ends: 34 [2022-07-12 18:22:37,097 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 18:22:37,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=39, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:22:37,098 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 55 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:37,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 32 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:37,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 18:22:37,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2022-07-12 18:22:37,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4074074074074074) internal successors, (38), 32 states have internal predecessors, (38), 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-12 18:22:37,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2022-07-12 18:22:37,101 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 11 [2022-07-12 18:22:37,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:37,102 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2022-07-12 18:22:37,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 7 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:37,102 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2022-07-12 18:22:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:22:37,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:37,102 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:37,102 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:22:37,103 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:37,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:37,103 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-12 18:22:37,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:37,103 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725857610] [2022-07-12 18:22:37,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:37,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:37,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:37,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725857610] [2022-07-12 18:22:37,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725857610] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:37,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [141913382] [2022-07-12 18:22:37,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:37,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:37,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:37,191 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-12 18:22:37,220 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-12 18:22:37,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:22:37,245 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:37,285 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:22:37,285 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:22:37,355 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:37,356 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:37,444 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:37,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [141913382] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:37,445 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:37,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-12 18:22:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529161928] [2022-07-12 18:22:37,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:37,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:22:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:22:37,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:22:37,447 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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-12 18:22:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:37,501 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-07-12 18:22:37,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:22:37,501 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:22:37,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:37,502 INFO L225 Difference]: With dead ends: 37 [2022-07-12 18:22:37,502 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 18:22:37,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:22:37,503 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 75 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:37,503 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 42 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:37,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 18:22:37,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 24. [2022-07-12 18:22:37,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 23 states have internal predecessors, (27), 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-12 18:22:37,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 18:22:37,506 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 11 [2022-07-12 18:22:37,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:37,506 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 18:22:37,506 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 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-12 18:22:37,507 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 18:22:37,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:22:37,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:37,507 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:37,532 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-12 18:22:37,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:37,727 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:37,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:37,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1319506494, now seen corresponding path program 1 times [2022-07-12 18:22:37,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:37,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860128823] [2022-07-12 18:22:37,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:37,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,761 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-12 18:22:37,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:37,762 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860128823] [2022-07-12 18:22:37,762 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860128823] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:37,762 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:37,762 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:37,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235291171] [2022-07-12 18:22:37,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:37,763 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:37,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:37,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:37,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:37,764 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:22:37,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:37,784 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-07-12 18:22:37,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:37,784 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 13 [2022-07-12 18:22:37,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:37,785 INFO L225 Difference]: With dead ends: 23 [2022-07-12 18:22:37,785 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 18:22:37,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12 18:22:37,786 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:37,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 28 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:37,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 18:22:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 18:22:37,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 19 states have (on average 1.368421052631579) internal successors, (26), 22 states have internal predecessors, (26), 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-12 18:22:37,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-12 18:22:37,788 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 13 [2022-07-12 18:22:37,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:37,789 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-12 18:22:37,789 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-12 18:22:37,789 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-12 18:22:37,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-12 18:22:37,790 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:37,790 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:37,790 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:22:37,790 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:37,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:37,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1319506495, now seen corresponding path program 1 times [2022-07-12 18:22:37,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:37,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224746726] [2022-07-12 18:22:37,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:37,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,845 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-12 18:22:37,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:37,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224746726] [2022-07-12 18:22:37,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224746726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:37,846 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2031974412] [2022-07-12 18:22:37,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:37,846 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:37,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:37,847 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-12 18:22:37,871 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-12 18:22:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:37,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-12 18:22:37,904 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:37,958 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-12 18:22:37,958 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:37,995 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 21 treesize of output 17 [2022-07-12 18:22:38,010 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-12 18:22:38,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2031974412] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:38,011 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:38,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-07-12 18:22:38,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84290522] [2022-07-12 18:22:38,011 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:22:38,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:38,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:22:38,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:22:38,013 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-12 18:22:38,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,108 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2022-07-12 18:22:38,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:38,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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 13 [2022-07-12 18:22:38,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,110 INFO L225 Difference]: With dead ends: 36 [2022-07-12 18:22:38,110 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 18:22:38,110 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:22:38,111 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 56 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:38,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 18:22:38,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2022-07-12 18:22:38,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.35) internal successors, (27), 23 states have internal predecessors, (27), 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-12 18:22:38,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 18:22:38,118 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2022-07-12 18:22:38,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,118 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 18:22:38,119 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 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-12 18:22:38,119 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 18:22:38,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:22:38,119 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,119 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,146 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-12 18:22:38,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:38,335 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:38,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,336 INFO L85 PathProgramCache]: Analyzing trace with hash -2044971629, now seen corresponding path program 1 times [2022-07-12 18:22:38,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:38,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806404448] [2022-07-12 18:22:38,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:38,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:38,408 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-12 18:22:38,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:38,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806404448] [2022-07-12 18:22:38,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806404448] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:38,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:38,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:38,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124306474] [2022-07-12 18:22:38,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:22:38,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:38,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:22:38,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:38,411 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 18:22:38,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,432 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-07-12 18:22:38,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:38,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-07-12 18:22:38,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,433 INFO L225 Difference]: With dead ends: 23 [2022-07-12 18:22:38,433 INFO L226 Difference]: Without dead ends: 23 [2022-07-12 18:22:38,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:22:38,434 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 27 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-12 18:22:38,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-12 18:22:38,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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-12 18:22:38,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-12 18:22:38,436 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-12 18:22:38,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,437 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-12 18:22:38,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 18:22:38,437 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-12 18:22:38,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:22:38,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:22:38,438 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:38,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash -2044971628, now seen corresponding path program 1 times [2022-07-12 18:22:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:38,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384533744] [2022-07-12 18:22:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:38,485 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-12 18:22:38,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:38,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384533744] [2022-07-12 18:22:38,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384533744] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:38,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:38,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:22:38,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498445203] [2022-07-12 18:22:38,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:22:38,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:38,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:22:38,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:22:38,488 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 18:22:38,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,522 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-12 18:22:38,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:22:38,522 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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 14 [2022-07-12 18:22:38,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,523 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:22:38,523 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:22:38,524 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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-12 18:22:38,524 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 34 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:38,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:22:38,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 24. [2022-07-12 18:22:38,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 23 states have internal predecessors, (27), 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-12 18:22:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-12 18:22:38,527 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 14 [2022-07-12 18:22:38,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,527 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-12 18:22:38,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 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-12 18:22:38,528 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-12 18:22:38,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:22:38,528 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,528 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:22:38,529 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:38,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1933649190, now seen corresponding path program 1 times [2022-07-12 18:22:38,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:38,530 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147674723] [2022-07-12 18:22:38,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:38,616 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-12 18:22:38,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:38,616 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147674723] [2022-07-12 18:22:38,616 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147674723] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:38,616 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:38,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:22:38,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542360121] [2022-07-12 18:22:38,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:22:38,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:38,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:22:38,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:22:38,618 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-12 18:22:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,698 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-07-12 18:22:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:22:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-07-12 18:22:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,699 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:22:38,699 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:22:38,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:22:38,701 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 21 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 90 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:38,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:22:38,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-12 18:22:38,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.21875) internal successors, (39), 34 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:38,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2022-07-12 18:22:38,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 17 [2022-07-12 18:22:38,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,704 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2022-07-12 18:22:38,704 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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-12 18:22:38,704 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2022-07-12 18:22:38,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:22:38,705 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,705 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,705 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:22:38,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:38,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1350200856, now seen corresponding path program 1 times [2022-07-12 18:22:38,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:38,706 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442253690] [2022-07-12 18:22:38,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:38,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:38,781 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-12 18:22:38,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:38,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442253690] [2022-07-12 18:22:38,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442253690] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:38,781 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:38,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:22:38,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330527400] [2022-07-12 18:22:38,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:38,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:22:38,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:38,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:22:38,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:22:38,783 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-12 18:22:38,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:38,892 INFO L93 Difference]: Finished difference Result 62 states and 68 transitions. [2022-07-12 18:22:38,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:22:38,892 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), 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 17 [2022-07-12 18:22:38,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:38,893 INFO L225 Difference]: With dead ends: 62 [2022-07-12 18:22:38,893 INFO L226 Difference]: Without dead ends: 62 [2022-07-12 18:22:38,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:22:38,894 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 28 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:38,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 108 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:38,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2022-07-12 18:22:38,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 36. [2022-07-12 18:22:38,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 35 states have internal predecessors, (41), 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-12 18:22:38,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-12 18:22:38,897 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 17 [2022-07-12 18:22:38,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:38,897 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-12 18:22:38,897 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), 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-12 18:22:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-12 18:22:38,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:22:38,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:38,898 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:38,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:22:38,899 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 70337178, now seen corresponding path program 1 times [2022-07-12 18:22:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:38,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1761317768] [2022-07-12 18:22:38,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:38,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:38,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:39,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:39,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1761317768] [2022-07-12 18:22:39,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1761317768] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:39,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845070992] [2022-07-12 18:22:39,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:39,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:39,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:39,024 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-12 18:22:39,026 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-12 18:22:39,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:39,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:22:39,081 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:39,158 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 14 treesize of output 10 [2022-07-12 18:22:39,219 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:22:39,221 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:39,222 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 18 treesize of output 10 [2022-07-12 18:22:39,227 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:39,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:39,273 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 13 treesize of output 11 [2022-07-12 18:22:39,278 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 20 treesize of output 18 [2022-07-12 18:22:39,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:39,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845070992] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:39,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:39,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2022-07-12 18:22:39,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907488074] [2022-07-12 18:22:39,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:39,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:22:39,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:39,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:22:39,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:22:39,416 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:39,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:39,602 INFO L93 Difference]: Finished difference Result 60 states and 67 transitions. [2022-07-12 18:22:39,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:22:39,602 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 18:22:39,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:39,604 INFO L225 Difference]: With dead ends: 60 [2022-07-12 18:22:39,604 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 18:22:39,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 107 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:22:39,605 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:39,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 133 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 94 Invalid, 0 Unknown, 25 Unchecked, 0.1s Time] [2022-07-12 18:22:39,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 18:22:39,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-07-12 18:22:39,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 39 states have internal predecessors, (46), 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-12 18:22:39,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2022-07-12 18:22:39,608 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 17 [2022-07-12 18:22:39,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:39,608 INFO L495 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2022-07-12 18:22:39,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 19 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:39,608 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2022-07-12 18:22:39,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:22:39,609 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:39,609 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:39,630 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-12 18:22:39,819 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,SelfDestructingSolverStorable15 [2022-07-12 18:22:39,820 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:39,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:39,820 INFO L85 PathProgramCache]: Analyzing trace with hash 186362076, now seen corresponding path program 1 times [2022-07-12 18:22:39,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:39,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306116297] [2022-07-12 18:22:39,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:39,821 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:39,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:39,893 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-12 18:22:39,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:39,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306116297] [2022-07-12 18:22:39,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306116297] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:22:39,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:22:39,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:22:39,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375448087] [2022-07-12 18:22:39,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:22:39,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:22:39,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:39,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:22:39,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:39,895 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12 18:22:39,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:39,905 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-12 18:22:39,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:22:39,906 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 18 [2022-07-12 18:22:39,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:39,906 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:22:39,906 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 18:22:39,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:22:39,907 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 6 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:39,907 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:22:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 18:22:39,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 18:22:39,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 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-12 18:22:39,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-12 18:22:39,909 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-12 18:22:39,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:39,910 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-12 18:22:39,910 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-12 18:22:39,910 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-12 18:22:39,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:22:39,911 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:39,911 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:39,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:22:39,911 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:39,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:39,912 INFO L85 PathProgramCache]: Analyzing trace with hash -2146020323, now seen corresponding path program 2 times [2022-07-12 18:22:39,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:39,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100667450] [2022-07-12 18:22:39,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:39,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:40,000 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:40,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:40,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100667450] [2022-07-12 18:22:40,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100667450] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:40,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [903898967] [2022-07-12 18:22:40,001 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:40,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:40,001 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:40,002 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-12 18:22:40,033 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-12 18:22:40,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:22:40,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:40,075 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-12 18:22:40,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:40,095 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:22:40,096 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:22:40,204 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:40,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:40,367 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:40,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [903898967] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:40,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:40,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 18 [2022-07-12 18:22:40,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345618634] [2022-07-12 18:22:40,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:40,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:22:40,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:40,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:22:40,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=273, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:22:40,371 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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-12 18:22:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:40,487 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2022-07-12 18:22:40,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:22:40,487 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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 21 [2022-07-12 18:22:40,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:40,487 INFO L225 Difference]: With dead ends: 31 [2022-07-12 18:22:40,488 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 18:22:40,488 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:22:40,488 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 128 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:40,489 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 43 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:40,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 18:22:40,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2022-07-12 18:22:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 25 states have (on average 1.12) internal successors, (28), 26 states have internal predecessors, (28), 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-12 18:22:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-07-12 18:22:40,490 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2022-07-12 18:22:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:40,491 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-07-12 18:22:40,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.9444444444444446) internal successors, (53), 19 states have internal predecessors, (53), 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-12 18:22:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-07-12 18:22:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:22:40,491 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:40,491 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:40,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:40,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:22:40,692 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:40,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2102120586, now seen corresponding path program 1 times [2022-07-12 18:22:40,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:40,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81763608] [2022-07-12 18:22:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:40,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:40,799 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:40,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81763608] [2022-07-12 18:22:40,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81763608] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:40,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [821431044] [2022-07-12 18:22:40,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:40,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:40,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:40,801 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-12 18:22:40,803 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-12 18:22:40,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:40,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-12 18:22:40,869 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:40,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:40,897 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 9 treesize of output 11 [2022-07-12 18:22:40,904 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 10 treesize of output 8 [2022-07-12 18:22:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:41,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:41,233 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:41,234 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [821431044] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:41,234 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:41,234 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 17 [2022-07-12 18:22:41,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212707584] [2022-07-12 18:22:41,234 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:41,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-12 18:22:41,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:41,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-12 18:22:41,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-12 18:22:41,236 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 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-12 18:22:41,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:41,406 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-12 18:22:41,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:22:41,407 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 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 22 [2022-07-12 18:22:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:41,407 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:22:41,408 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:22:41,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:22:41,408 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 113 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:41,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 47 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:41,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:22:41,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-12 18:22:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 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-12 18:22:41,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2022-07-12 18:22:41,410 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 22 [2022-07-12 18:22:41,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:41,410 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2022-07-12 18:22:41,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.3529411764705883) internal successors, (57), 18 states have internal predecessors, (57), 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-12 18:22:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2022-07-12 18:22:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-12 18:22:41,411 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:41,411 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:41,437 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-12 18:22:41,612 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:41,612 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:41,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:41,613 INFO L85 PathProgramCache]: Analyzing trace with hash 643759544, now seen corresponding path program 3 times [2022-07-12 18:22:41,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:41,613 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741078300] [2022-07-12 18:22:41,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:41,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:41,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:41,851 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:41,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741078300] [2022-07-12 18:22:41,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741078300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:41,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1692985158] [2022-07-12 18:22:41,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:22:41,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:41,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:41,853 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-12 18:22:41,856 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-12 18:22:41,923 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-12 18:22:41,923 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:41,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-12 18:22:41,927 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:41,932 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 10 treesize of output 8 [2022-07-12 18:22:42,051 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 14 treesize of output 10 [2022-07-12 18:22:42,141 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 17 treesize of output 19 [2022-07-12 18:22:42,190 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-12 18:22:42,193 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:42,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:42,221 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_262) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:22:42,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_262 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_262) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:22:42,246 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:42,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:22:42,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:42,252 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 37 treesize of output 37 [2022-07-12 18:22:42,256 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 11 treesize of output 7 [2022-07-12 18:22:42,442 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:22:42,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1692985158] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:42,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:42,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 12] total 24 [2022-07-12 18:22:42,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927300608] [2022-07-12 18:22:42,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:42,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:22:42,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:42,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:22:42,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=397, Unknown=2, NotChecked=82, Total=552 [2022-07-12 18:22:42,444 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 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-12 18:22:42,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:42,703 INFO L93 Difference]: Finished difference Result 44 states and 45 transitions. [2022-07-12 18:22:42,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-12 18:22:42,704 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-07-12 18:22:42,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:42,704 INFO L225 Difference]: With dead ends: 44 [2022-07-12 18:22:42,704 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 18:22:42,705 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 34 SyntacticMatches, 6 SemanticMatches, 30 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=134, Invalid=742, Unknown=2, NotChecked=114, Total=992 [2022-07-12 18:22:42,705 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 30 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:42,705 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 136 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 180 Invalid, 0 Unknown, 93 Unchecked, 0.1s Time] [2022-07-12 18:22:42,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 18:22:42,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-07-12 18:22:42,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 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-12 18:22:42,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-12 18:22:42,707 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 25 [2022-07-12 18:22:42,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:42,707 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-12 18:22:42,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 24 states have internal predecessors, (52), 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-12 18:22:42,707 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-12 18:22:42,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-12 18:22:42,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:42,708 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:42,734 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-12 18:22:42,923 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:42,923 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:42,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:42,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1470618683, now seen corresponding path program 4 times [2022-07-12 18:22:42,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:42,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389980563] [2022-07-12 18:22:42,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:42,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:42,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389980563] [2022-07-12 18:22:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389980563] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729065398] [2022-07-12 18:22:43,049 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:22:43,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:43,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:43,050 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-12 18:22:43,051 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-12 18:22:43,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:22:43,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:43,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-12 18:22:43,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:43,246 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:43,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:43,368 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 5 [2022-07-12 18:22:43,382 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:43,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729065398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:43,383 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:43,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 19 [2022-07-12 18:22:43,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003163064] [2022-07-12 18:22:43,383 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:43,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-12 18:22:43,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:43,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-12 18:22:43,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2022-07-12 18:22:43,384 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 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-12 18:22:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:43,622 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2022-07-12 18:22:43,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:22:43,622 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 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 29 [2022-07-12 18:22:43,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:43,623 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:22:43,623 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:22:43,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:22:43,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 89 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:43,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 109 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:22:43,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2022-07-12 18:22:43,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.0909090909090908) internal successors, (36), 34 states have internal predecessors, (36), 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-12 18:22:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-12 18:22:43,625 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 29 [2022-07-12 18:22:43,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:43,626 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-12 18:22:43,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.3684210526315788) internal successors, (64), 20 states have internal predecessors, (64), 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-12 18:22:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-12 18:22:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:22:43,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:43,626 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:43,655 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-12 18:22:43,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:43,831 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:43,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:43,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1655461096, now seen corresponding path program 2 times [2022-07-12 18:22:43,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:43,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967010257] [2022-07-12 18:22:43,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:43,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:43,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:43,928 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:43,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:43,928 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967010257] [2022-07-12 18:22:43,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967010257] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:43,929 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837927044] [2022-07-12 18:22:43,929 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:43,929 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:43,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:43,930 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-12 18:22:43,932 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-12 18:22:43,998 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:22:43,998 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:44,000 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-12 18:22:44,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:44,013 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:22:44,014 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 9 treesize of output 11 [2022-07-12 18:22:44,018 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 10 treesize of output 8 [2022-07-12 18:22:44,190 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 6 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:44,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:44,416 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 15 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:44,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837927044] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:44,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:44,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2022-07-12 18:22:44,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858999718] [2022-07-12 18:22:44,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:44,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-12 18:22:44,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:44,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-12 18:22:44,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=460, Unknown=0, NotChecked=0, Total=552 [2022-07-12 18:22:44,417 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 24 states have internal predecessors, (81), 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-12 18:22:44,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:44,648 INFO L93 Difference]: Finished difference Result 38 states and 39 transitions. [2022-07-12 18:22:44,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:22:44,651 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 24 states have internal predecessors, (81), 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 30 [2022-07-12 18:22:44,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:44,651 INFO L225 Difference]: With dead ends: 38 [2022-07-12 18:22:44,651 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:22:44,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=206, Invalid=724, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:22:44,652 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 116 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:44,653 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 69 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:22:44,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:22:44,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2022-07-12 18:22:44,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 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-12 18:22:44,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-12 18:22:44,655 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 30 [2022-07-12 18:22:44,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:44,655 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-12 18:22:44,655 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 3.5217391304347827) internal successors, (81), 24 states have internal predecessors, (81), 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-12 18:22:44,655 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-12 18:22:44,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-12 18:22:44,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:44,656 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:44,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:44,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-12 18:22:44,867 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:44,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:44,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1267943126, now seen corresponding path program 5 times [2022-07-12 18:22:44,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:44,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425501314] [2022-07-12 18:22:44,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:44,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:44,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:45,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 5 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:45,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425501314] [2022-07-12 18:22:45,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425501314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:45,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385633251] [2022-07-12 18:22:45,074 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:22:45,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:45,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:45,075 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:45,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-12 18:22:45,157 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-12 18:22:45,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:45,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-12 18:22:45,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:45,171 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 10 treesize of output 8 [2022-07-12 18:22:45,178 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 9 treesize of output 11 [2022-07-12 18:22:45,343 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 14 treesize of output 10 [2022-07-12 18:22:45,438 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 16 treesize of output 18 [2022-07-12 18:22:45,506 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 16 treesize of output 18 [2022-07-12 18:22:45,588 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:45,588 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 17 treesize of output 17 [2022-07-12 18:22:45,692 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:45,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:46,013 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:46,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:22:46,021 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:46,021 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 37 treesize of output 37 [2022-07-12 18:22:46,024 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 11 treesize of output 7 [2022-07-12 18:22:46,320 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:46,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385633251] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:46,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:46,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 37 [2022-07-12 18:22:46,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123076577] [2022-07-12 18:22:46,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:46,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 18:22:46,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:46,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 18:22:46,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1195, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:22:46,324 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:46,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:46,977 INFO L93 Difference]: Finished difference Result 60 states and 61 transitions. [2022-07-12 18:22:46,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:22:46,977 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-12 18:22:46,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:46,977 INFO L225 Difference]: With dead ends: 60 [2022-07-12 18:22:46,978 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 18:22:46,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=315, Invalid=2441, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 18:22:46,979 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 61 mSDsluCounter, 203 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:46,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 215 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 291 Invalid, 0 Unknown, 102 Unchecked, 0.1s Time] [2022-07-12 18:22:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 18:22:46,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-07-12 18:22:46,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 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-12 18:22:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-12 18:22:46,982 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 33 [2022-07-12 18:22:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:46,982 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-12 18:22:46,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.4594594594594597) internal successors, (91), 37 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:22:46,982 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-12 18:22:46,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-12 18:22:46,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:46,983 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:47,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:47,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-12 18:22:47,203 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:47,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:47,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1740941126, now seen corresponding path program 3 times [2022-07-12 18:22:47,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:47,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387899529] [2022-07-12 18:22:47,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:47,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:47,321 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:47,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:47,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387899529] [2022-07-12 18:22:47,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387899529] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:47,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1345017648] [2022-07-12 18:22:47,321 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:22:47,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:47,322 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:47,323 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:47,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-12 18:22:47,401 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:22:47,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:47,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 18:22:47,409 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:47,418 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 10 treesize of output 8 [2022-07-12 18:22:47,423 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 9 treesize of output 11 [2022-07-12 18:22:47,768 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:22:47,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:48,102 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-12 18:22:48,102 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1345017648] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:48,102 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:48,103 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 24 [2022-07-12 18:22:48,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446873822] [2022-07-12 18:22:48,103 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:48,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-07-12 18:22:48,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:48,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-07-12 18:22:48,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=507, Unknown=0, NotChecked=0, Total=600 [2022-07-12 18:22:48,104 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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-12 18:22:48,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:48,773 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-12 18:22:48,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:22:48,773 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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 38 [2022-07-12 18:22:48,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:48,773 INFO L225 Difference]: With dead ends: 59 [2022-07-12 18:22:48,774 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 18:22:48,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=310, Invalid=1250, Unknown=0, NotChecked=0, Total=1560 [2022-07-12 18:22:48,775 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 112 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 287 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 287 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 18 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:48,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 115 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 287 Invalid, 0 Unknown, 18 Unchecked, 0.2s Time] [2022-07-12 18:22:48,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 18:22:48,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-12 18:22:48,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.1111111111111112) internal successors, (60), 55 states have internal predecessors, (60), 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-12 18:22:48,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-07-12 18:22:48,777 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 38 [2022-07-12 18:22:48,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:48,777 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-07-12 18:22:48,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.4166666666666665) internal successors, (82), 25 states have internal predecessors, (82), 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-12 18:22:48,777 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-07-12 18:22:48,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:22:48,778 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:48,778 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:48,795 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 18:22:48,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 18:22:48,983 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:48,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:48,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1647975924, now seen corresponding path program 6 times [2022-07-12 18:22:48,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:48,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243068849] [2022-07-12 18:22:48,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:49,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:49,247 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:49,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243068849] [2022-07-12 18:22:49,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243068849] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:49,248 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736274934] [2022-07-12 18:22:49,248 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:22:49,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:49,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:49,249 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:49,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-12 18:22:49,353 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-12 18:22:49,353 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:49,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:22:49,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:49,367 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 10 treesize of output 8 [2022-07-12 18:22:49,555 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 14 treesize of output 10 [2022-07-12 18:22:49,630 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 17 treesize of output 19 [2022-07-12 18:22:49,669 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 16 treesize of output 18 [2022-07-12 18:22:49,683 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 16 treesize of output 18 [2022-07-12 18:22:49,714 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-12 18:22:49,717 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:49,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:49,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:22:49,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:22:49,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)))) is different from false [2022-07-12 18:22:49,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_479) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:22:49,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:49,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:22:49,777 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:49,777 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 37 treesize of output 37 [2022-07-12 18:22:49,781 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 11 treesize of output 7 [2022-07-12 18:22:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 7 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 20 not checked. [2022-07-12 18:22:49,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736274934] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:49,944 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:49,944 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 31 [2022-07-12 18:22:49,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241038129] [2022-07-12 18:22:49,944 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:49,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 18:22:49,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:49,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 18:22:49,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=631, Unknown=4, NotChecked=212, Total=930 [2022-07-12 18:22:49,946 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 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-12 18:22:50,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:50,330 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-12 18:22:50,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:22:50,330 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 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 41 [2022-07-12 18:22:50,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:50,330 INFO L225 Difference]: With dead ends: 80 [2022-07-12 18:22:50,330 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:22:50,331 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 63 SyntacticMatches, 9 SemanticMatches, 38 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 257 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=149, Invalid=1123, Unknown=4, NotChecked=284, Total=1560 [2022-07-12 18:22:50,331 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 45 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 188 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:50,332 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 237 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 410 Invalid, 0 Unknown, 188 Unchecked, 0.2s Time] [2022-07-12 18:22:50,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:22:50,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-12 18:22:50,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.103448275862069) internal successors, (64), 59 states have internal predecessors, (64), 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-12 18:22:50,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-07-12 18:22:50,334 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 41 [2022-07-12 18:22:50,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:50,334 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-07-12 18:22:50,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.7419354838709675) internal successors, (85), 31 states have internal predecessors, (85), 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-12 18:22:50,335 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-07-12 18:22:50,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-12 18:22:50,335 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:50,335 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:50,356 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:50,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:22:50,552 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:50,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:50,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1728866697, now seen corresponding path program 7 times [2022-07-12 18:22:50,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:50,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369622510] [2022-07-12 18:22:50,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:50,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:50,734 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 15 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:50,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:50,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369622510] [2022-07-12 18:22:50,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369622510] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:50,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1646626682] [2022-07-12 18:22:50,734 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:22:50,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:50,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:50,736 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:50,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-12 18:22:50,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:50,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-12 18:22:50,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:51,011 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:51,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:51,205 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 5 [2022-07-12 18:22:51,226 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 32 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:51,227 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1646626682] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:51,227 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:51,227 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 27 [2022-07-12 18:22:51,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288215828] [2022-07-12 18:22:51,227 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:51,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 18:22:51,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:51,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 18:22:51,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:22:51,228 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 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-12 18:22:51,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:51,607 INFO L93 Difference]: Finished difference Result 60 states and 63 transitions. [2022-07-12 18:22:51,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 18:22:51,608 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 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 45 [2022-07-12 18:22:51,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:51,609 INFO L225 Difference]: With dead ends: 60 [2022-07-12 18:22:51,609 INFO L226 Difference]: Without dead ends: 60 [2022-07-12 18:22:51,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=1182, Unknown=0, NotChecked=0, Total=1482 [2022-07-12 18:22:51,610 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 140 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:51,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 171 Invalid, 458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:22:51,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-07-12 18:22:51,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-07-12 18:22:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0862068965517242) internal successors, (63), 59 states have internal predecessors, (63), 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-12 18:22:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 63 transitions. [2022-07-12 18:22:51,613 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 63 transitions. Word has length 45 [2022-07-12 18:22:51,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:51,613 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 63 transitions. [2022-07-12 18:22:51,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.5555555555555554) internal successors, (96), 28 states have internal predecessors, (96), 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-12 18:22:51,613 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 63 transitions. [2022-07-12 18:22:51,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 18:22:51,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:51,614 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:51,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:51,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:51,824 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:51,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:51,824 INFO L85 PathProgramCache]: Analyzing trace with hash 801080082, now seen corresponding path program 8 times [2022-07-12 18:22:51,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:51,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587630656] [2022-07-12 18:22:51,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:51,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:51,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:52,161 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 9 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:52,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:52,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587630656] [2022-07-12 18:22:52,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587630656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:52,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1156522594] [2022-07-12 18:22:52,161 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:22:52,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:52,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:52,163 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:52,163 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-12 18:22:52,245 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:22:52,245 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:52,247 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-12 18:22:52,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:52,259 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 10 treesize of output 8 [2022-07-12 18:22:52,395 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 14 treesize of output 10 [2022-07-12 18:22:52,514 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 17 treesize of output 19 [2022-07-12 18:22:52,595 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 17 treesize of output 19 [2022-07-12 18:22:52,682 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 17 treesize of output 19 [2022-07-12 18:22:52,773 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 17 treesize of output 19 [2022-07-12 18:22:52,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:52,886 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 18 treesize of output 18 [2022-07-12 18:22:53,015 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:53,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:53,487 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_590 (Array Int Int)) (|v_ULTIMATE.start_cstpcpy_~from#1.offset_68| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstpcpy_~from#1.offset_68|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_590) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_68| 4)) 0) (<= (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_68| 6) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstpcpy_~from#1.offset_68|))) is different from false [2022-07-12 18:22:53,498 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:53,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:22:53,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:53,507 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 37 treesize of output 37 [2022-07-12 18:22:53,512 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 11 treesize of output 7 [2022-07-12 18:22:53,516 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 16 treesize of output 12 [2022-07-12 18:22:53,859 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:53,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1156522594] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:53,860 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:53,860 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 51 [2022-07-12 18:22:53,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153189404] [2022-07-12 18:22:53,860 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:53,861 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:22:53,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:53,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:22:53,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2231, Unknown=1, NotChecked=96, Total=2550 [2022-07-12 18:22:53,862 INFO L87 Difference]: Start difference. First operand 60 states and 63 transitions. Second operand has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 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-12 18:22:54,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:54,655 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-12 18:22:54,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:22:54,656 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 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 49 [2022-07-12 18:22:54,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:54,656 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:22:54,656 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 18:22:54,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 78 SyntacticMatches, 3 SemanticMatches, 66 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 849 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=442, Invalid=3983, Unknown=1, NotChecked=130, Total=4556 [2022-07-12 18:22:54,658 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 96 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 285 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 248 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:54,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 285 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 342 Invalid, 0 Unknown, 248 Unchecked, 0.2s Time] [2022-07-12 18:22:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 18:22:54,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-12 18:22:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.064516129032258) internal successors, (66), 63 states have internal predecessors, (66), 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-12 18:22:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 66 transitions. [2022-07-12 18:22:54,660 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 66 transitions. Word has length 49 [2022-07-12 18:22:54,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:54,660 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 66 transitions. [2022-07-12 18:22:54,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.7254901960784315) internal successors, (139), 51 states have internal predecessors, (139), 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-12 18:22:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 66 transitions. [2022-07-12 18:22:54,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 18:22:54,661 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:54,661 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:54,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-12 18:22:54,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:22:54,862 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:54,862 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:54,862 INFO L85 PathProgramCache]: Analyzing trace with hash -795904464, now seen corresponding path program 9 times [2022-07-12 18:22:54,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:54,862 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [976078790] [2022-07-12 18:22:54,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:54,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:54,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:55,224 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 11 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:55,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:55,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [976078790] [2022-07-12 18:22:55,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [976078790] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:55,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812606410] [2022-07-12 18:22:55,225 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:22:55,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:55,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:55,227 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:55,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-12 18:22:55,367 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-12 18:22:55,367 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:55,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 18:22:55,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:55,379 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 10 treesize of output 8 [2022-07-12 18:22:55,383 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 9 treesize of output 11 [2022-07-12 18:22:55,818 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 14 treesize of output 10 [2022-07-12 18:22:55,911 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 16 treesize of output 18 [2022-07-12 18:22:56,000 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 16 treesize of output 18 [2022-07-12 18:22:56,081 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 16 treesize of output 18 [2022-07-12 18:22:56,165 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 16 treesize of output 18 [2022-07-12 18:22:56,255 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 16 treesize of output 18 [2022-07-12 18:22:56,327 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:56,327 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 17 treesize of output 17 [2022-07-12 18:22:56,454 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 60 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:56,454 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:57,060 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:57,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:22:57,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:57,067 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 37 treesize of output 37 [2022-07-12 18:22:57,071 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 11 treesize of output 7 [2022-07-12 18:22:57,797 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 24 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:57,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812606410] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:57,798 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:57,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 21] total 58 [2022-07-12 18:22:57,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012608228] [2022-07-12 18:22:57,798 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:57,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-07-12 18:22:57,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:57,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-07-12 18:22:57,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=3015, Unknown=7, NotChecked=0, Total=3306 [2022-07-12 18:22:57,802 INFO L87 Difference]: Start difference. First operand 64 states and 66 transitions. Second operand has 58 states, 58 states have (on average 2.810344827586207) internal successors, (163), 58 states have internal predecessors, (163), 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-12 18:22:59,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:22:59,039 INFO L93 Difference]: Finished difference Result 95 states and 96 transitions. [2022-07-12 18:22:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 18:22:59,040 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.810344827586207) internal successors, (163), 58 states have internal predecessors, (163), 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 57 [2022-07-12 18:22:59,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:22:59,040 INFO L225 Difference]: With dead ends: 95 [2022-07-12 18:22:59,041 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 18:22:59,042 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1076 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=649, Invalid=6150, Unknown=7, NotChecked=0, Total=6806 [2022-07-12 18:22:59,042 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 120 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 245 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:22:59,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 396 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 521 Invalid, 0 Unknown, 245 Unchecked, 0.2s Time] [2022-07-12 18:22:59,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 18:22:59,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-12 18:22:59,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 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-12 18:22:59,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-12 18:22:59,045 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 57 [2022-07-12 18:22:59,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:22:59,045 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-12 18:22:59,045 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.810344827586207) internal successors, (163), 58 states have internal predecessors, (163), 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-12 18:22:59,045 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-12 18:22:59,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-12 18:22:59,045 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:22:59,045 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:22:59,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-12 18:22:59,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 18:22:59,246 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:22:59,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:22:59,246 INFO L85 PathProgramCache]: Analyzing trace with hash 940963662, now seen corresponding path program 10 times [2022-07-12 18:22:59,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:22:59,246 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353089812] [2022-07-12 18:22:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:22:59,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:22:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:22:59,668 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 13 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:22:59,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:22:59,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353089812] [2022-07-12 18:22:59,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353089812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:22:59,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591751506] [2022-07-12 18:22:59,668 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:22:59,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:22:59,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:22:59,669 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:22:59,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-12 18:22:59,811 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:22:59,811 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:22:59,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-12 18:22:59,815 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:22:59,827 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:22:59,828 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:22:59,835 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 10 treesize of output 8 [2022-07-12 18:23:00,137 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:23:00,232 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-12 18:23:00,245 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-12 18:23:00,296 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-12 18:23:00,350 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-12 18:23:00,401 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-12 18:23:00,453 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-12 18:23:00,507 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-12 18:23:00,576 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-12 18:23:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 13 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:00,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:00,640 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:23:00,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:00,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:23:00,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:23:00,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)))) is different from false [2022-07-12 18:23:00,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_746) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)))) is different from false [2022-07-12 18:23:00,723 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_746 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_746) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:23:00,728 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:00,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:00,736 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:00,736 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 37 treesize of output 37 [2022-07-12 18:23:00,740 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 11 treesize of output 7 [2022-07-12 18:23:01,272 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 13 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2022-07-12 18:23:01,273 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591751506] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:01,273 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:01,273 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 55 [2022-07-12 18:23:01,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204046134] [2022-07-12 18:23:01,273 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:01,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 18:23:01,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:01,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 18:23:01,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2115, Unknown=7, NotChecked=686, Total=2970 [2022-07-12 18:23:01,275 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 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-12 18:23:02,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:02,581 INFO L93 Difference]: Finished difference Result 104 states and 105 transitions. [2022-07-12 18:23:02,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:23:02,582 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 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 65 [2022-07-12 18:23:02,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:02,582 INFO L225 Difference]: With dead ends: 104 [2022-07-12 18:23:02,582 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 18:23:02,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 101 SyntacticMatches, 5 SemanticMatches, 75 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 844 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=384, Invalid=4467, Unknown=7, NotChecked=994, Total=5852 [2022-07-12 18:23:02,584 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 80 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 1900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 460 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:02,584 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 584 Invalid, 1900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 1393 Invalid, 0 Unknown, 460 Unchecked, 0.5s Time] [2022-07-12 18:23:02,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 18:23:02,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-12 18:23:02,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 70 states have (on average 1.042857142857143) internal successors, (73), 71 states have internal predecessors, (73), 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-12 18:23:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-12 18:23:02,587 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 65 [2022-07-12 18:23:02,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:02,587 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-12 18:23:02,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 3.1454545454545455) internal successors, (173), 55 states have internal predecessors, (173), 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-12 18:23:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-12 18:23:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-07-12 18:23:02,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:02,588 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:02,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-12 18:23:02,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 18:23:02,795 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:02,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:02,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1553913553, now seen corresponding path program 11 times [2022-07-12 18:23:02,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:02,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367202228] [2022-07-12 18:23:02,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:02,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:02,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:03,040 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 66 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:03,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:03,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367202228] [2022-07-12 18:23:03,040 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367202228] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:03,040 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1397367459] [2022-07-12 18:23:03,041 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:23:03,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:03,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:03,042 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:03,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-12 18:23:03,354 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2022-07-12 18:23:03,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:03,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-12 18:23:03,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:03,372 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:23:03,372 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:23:03,836 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 91 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:03,836 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:04,435 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 120 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:04,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1397367459] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:04,435 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:04,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 50 [2022-07-12 18:23:04,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139796302] [2022-07-12 18:23:04,436 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:04,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:23:04,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:04,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:23:04,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=365, Invalid=2185, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:23:04,438 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 51 states, 50 states have (on average 3.8) internal successors, (190), 51 states have internal predecessors, (190), 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-12 18:23:04,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:04,895 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2022-07-12 18:23:04,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:23:04,896 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.8) internal successors, (190), 51 states have internal predecessors, (190), 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 69 [2022-07-12 18:23:04,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:04,896 INFO L225 Difference]: With dead ends: 79 [2022-07-12 18:23:04,896 INFO L226 Difference]: Without dead ends: 79 [2022-07-12 18:23:04,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 104 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 860 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=704, Invalid=2956, Unknown=0, NotChecked=0, Total=3660 [2022-07-12 18:23:04,898 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 163 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:04,898 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 294 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:23:04,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-07-12 18:23:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2022-07-12 18:23:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 74 states have internal predecessors, (76), 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-12 18:23:04,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-12 18:23:04,900 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 69 [2022-07-12 18:23:04,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:04,900 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-12 18:23:04,900 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.8) internal successors, (190), 51 states have internal predecessors, (190), 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-12 18:23:04,900 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-12 18:23:04,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-12 18:23:04,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:04,901 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:04,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:05,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:05,115 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:05,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:05,116 INFO L85 PathProgramCache]: Analyzing trace with hash 926679874, now seen corresponding path program 4 times [2022-07-12 18:23:05,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:05,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862352815] [2022-07-12 18:23:05,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:05,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:05,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:05,371 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 66 proven. 152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:05,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:05,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862352815] [2022-07-12 18:23:05,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862352815] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:05,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741087368] [2022-07-12 18:23:05,373 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:23:05,373 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:05,373 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:05,374 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:05,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-12 18:23:05,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:23:05,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:05,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 327 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 18:23:05,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:05,493 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:23:05,493 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:23:05,502 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 10 treesize of output 8 [2022-07-12 18:23:06,392 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 98 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:06,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:07,121 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 120 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:07,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741087368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:07,121 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:07,121 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 54 [2022-07-12 18:23:07,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474549113] [2022-07-12 18:23:07,123 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:07,123 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-12 18:23:07,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:07,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-12 18:23:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=2639, Unknown=0, NotChecked=0, Total=2970 [2022-07-12 18:23:07,125 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 55 states, 54 states have (on average 3.740740740740741) internal successors, (202), 55 states have internal predecessors, (202), 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-12 18:23:07,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:07,690 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-07-12 18:23:07,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:23:07,690 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.740740740740741) internal successors, (202), 55 states have internal predecessors, (202), 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 70 [2022-07-12 18:23:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:07,691 INFO L225 Difference]: With dead ends: 77 [2022-07-12 18:23:07,691 INFO L226 Difference]: Without dead ends: 77 [2022-07-12 18:23:07,692 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 103 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1043 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=553, Invalid=3737, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 18:23:07,692 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 140 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:07,693 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 458 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 522 Invalid, 0 Unknown, 140 Unchecked, 0.2s Time] [2022-07-12 18:23:07,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-12 18:23:07,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2022-07-12 18:23:07,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 74 states have (on average 1.0405405405405406) internal successors, (77), 75 states have internal predecessors, (77), 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-12 18:23:07,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2022-07-12 18:23:07,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 70 [2022-07-12 18:23:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:07,695 INFO L495 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2022-07-12 18:23:07,696 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.740740740740741) internal successors, (202), 55 states have internal predecessors, (202), 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-12 18:23:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2022-07-12 18:23:07,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 18:23:07,696 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:07,696 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:07,714 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:07,900 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:07,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1329658260, now seen corresponding path program 12 times [2022-07-12 18:23:07,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:07,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892544447] [2022-07-12 18:23:07,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 15 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:08,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:08,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892544447] [2022-07-12 18:23:08,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1892544447] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:08,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1794024850] [2022-07-12 18:23:08,394 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:23:08,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:08,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:08,396 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:08,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-12 18:23:08,731 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-12 18:23:08,731 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:08,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-12 18:23:08,741 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:08,745 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 10 treesize of output 8 [2022-07-12 18:23:09,037 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 14 treesize of output 10 [2022-07-12 18:23:09,121 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 17 treesize of output 19 [2022-07-12 18:23:09,164 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 16 treesize of output 18 [2022-07-12 18:23:09,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 16 treesize of output 18 [2022-07-12 18:23:09,187 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 16 treesize of output 18 [2022-07-12 18:23:09,198 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 16 treesize of output 18 [2022-07-12 18:23:09,210 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 16 treesize of output 18 [2022-07-12 18:23:09,238 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 16 treesize of output 18 [2022-07-12 18:23:09,265 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-12 18:23:09,268 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 15 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:09,268 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:09,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:23:09,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:09,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:23:09,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:23:09,321 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:09,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:23:09,341 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_988) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:09,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_988 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_988) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:23:09,355 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:09,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:09,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:09,360 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 37 treesize of output 37 [2022-07-12 18:23:09,363 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 11 treesize of output 7 [2022-07-12 18:23:09,684 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 15 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 104 not checked. [2022-07-12 18:23:09,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1794024850] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:09,684 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:09,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 47 [2022-07-12 18:23:09,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836694416] [2022-07-12 18:23:09,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:09,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-12 18:23:09,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:09,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-12 18:23:09,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1387, Unknown=8, NotChecked=648, Total=2162 [2022-07-12 18:23:09,686 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 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-12 18:23:10,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:10,681 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-07-12 18:23:10,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:23:10,681 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 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 73 [2022-07-12 18:23:10,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:10,682 INFO L225 Difference]: With dead ends: 116 [2022-07-12 18:23:10,682 INFO L226 Difference]: Without dead ends: 83 [2022-07-12 18:23:10,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 120 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=209, Invalid=2467, Unknown=8, NotChecked=856, Total=3540 [2022-07-12 18:23:10,685 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 41 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 1383 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 618 SdHoareTripleChecker+Invalid, 1903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 506 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:10,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 618 Invalid, 1903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1383 Invalid, 0 Unknown, 506 Unchecked, 0.5s Time] [2022-07-12 18:23:10,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-12 18:23:10,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2022-07-12 18:23:10,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.0384615384615385) internal successors, (81), 79 states have internal predecessors, (81), 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-12 18:23:10,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 81 transitions. [2022-07-12 18:23:10,689 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 81 transitions. Word has length 73 [2022-07-12 18:23:10,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:10,690 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 81 transitions. [2022-07-12 18:23:10,690 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 3.1702127659574466) internal successors, (149), 47 states have internal predecessors, (149), 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-12 18:23:10,690 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 81 transitions. [2022-07-12 18:23:10,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 18:23:10,691 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:10,691 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:10,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:10,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-07-12 18:23:10,903 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:10,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:10,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1224585967, now seen corresponding path program 13 times [2022-07-12 18:23:10,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:10,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003081760] [2022-07-12 18:23:10,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:10,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:10,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 91 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:11,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:11,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003081760] [2022-07-12 18:23:11,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003081760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:11,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248809047] [2022-07-12 18:23:11,193 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:23:11,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:11,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:11,194 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:11,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-12 18:23:11,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:11,306 INFO L263 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-12 18:23:11,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:11,601 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 128 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:11,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:11,940 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 5 [2022-07-12 18:23:11,973 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 128 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:11,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248809047] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:11,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:11,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21, 21] total 43 [2022-07-12 18:23:11,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502488663] [2022-07-12 18:23:11,974 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:11,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-07-12 18:23:11,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:11,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-07-12 18:23:11,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=1677, Unknown=0, NotChecked=0, Total=1892 [2022-07-12 18:23:11,975 INFO L87 Difference]: Start difference. First operand 80 states and 81 transitions. Second operand has 44 states, 43 states have (on average 3.7209302325581395) internal successors, (160), 44 states have internal predecessors, (160), 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-12 18:23:12,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:12,757 INFO L93 Difference]: Finished difference Result 87 states and 88 transitions. [2022-07-12 18:23:12,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:23:12,758 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 3.7209302325581395) internal successors, (160), 44 states have internal predecessors, (160), 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 77 [2022-07-12 18:23:12,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:12,759 INFO L225 Difference]: With dead ends: 87 [2022-07-12 18:23:12,759 INFO L226 Difference]: Without dead ends: 87 [2022-07-12 18:23:12,760 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=746, Invalid=3160, Unknown=0, NotChecked=0, Total=3906 [2022-07-12 18:23:12,760 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 254 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1083 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 1083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:12,760 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 405 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 1083 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:23:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-07-12 18:23:12,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2022-07-12 18:23:12,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 81 states have (on average 1.037037037037037) internal successors, (84), 82 states have internal predecessors, (84), 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-12 18:23:12,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-12 18:23:12,762 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 77 [2022-07-12 18:23:12,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:12,763 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-12 18:23:12,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 3.7209302325581395) internal successors, (160), 44 states have internal predecessors, (160), 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-12 18:23:12,763 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-12 18:23:12,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 18:23:12,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:12,764 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:12,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:12,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-12 18:23:12,979 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:12,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:12,980 INFO L85 PathProgramCache]: Analyzing trace with hash -692540700, now seen corresponding path program 5 times [2022-07-12 18:23:12,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:12,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73230526] [2022-07-12 18:23:12,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:12,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:13,302 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 91 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:13,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:13,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73230526] [2022-07-12 18:23:13,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73230526] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:13,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701362058] [2022-07-12 18:23:13,302 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:23:13,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:13,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:13,303 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:13,304 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-12 18:23:13,691 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-12 18:23:13,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:13,695 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 68 conjunts are in the unsatisfiable core [2022-07-12 18:23:13,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:13,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:13,705 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 9 treesize of output 11 [2022-07-12 18:23:13,707 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 10 treesize of output 8 [2022-07-12 18:23:14,239 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 120 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:14,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:14,975 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 153 proven. 128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:14,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701362058] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:14,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:14,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 56 [2022-07-12 18:23:14,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098169916] [2022-07-12 18:23:14,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:14,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-12 18:23:14,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:14,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-12 18:23:14,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=446, Invalid=2746, Unknown=0, NotChecked=0, Total=3192 [2022-07-12 18:23:14,977 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 57 states, 56 states have (on average 3.875) internal successors, (217), 57 states have internal predecessors, (217), 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-12 18:23:15,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:15,458 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2022-07-12 18:23:15,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:23:15,459 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 3.875) internal successors, (217), 57 states have internal predecessors, (217), 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 78 [2022-07-12 18:23:15,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:15,459 INFO L225 Difference]: With dead ends: 86 [2022-07-12 18:23:15,459 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:23:15,460 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=858, Invalid=3698, Unknown=0, NotChecked=0, Total=4556 [2022-07-12 18:23:15,460 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 305 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 832 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 305 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:15,460 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [305 Valid, 299 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 832 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:23:15,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:23:15,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 84. [2022-07-12 18:23:15,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 82 states have (on average 1.0365853658536586) internal successors, (85), 83 states have internal predecessors, (85), 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-12 18:23:15,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2022-07-12 18:23:15,462 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 78 [2022-07-12 18:23:15,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:15,462 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2022-07-12 18:23:15,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 3.875) internal successors, (217), 57 states have internal predecessors, (217), 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-12 18:23:15,462 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2022-07-12 18:23:15,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-12 18:23:15,463 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:15,463 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:15,484 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:15,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:15,675 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:15,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:15,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1542890378, now seen corresponding path program 14 times [2022-07-12 18:23:15,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:15,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336732199] [2022-07-12 18:23:15,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:15,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:16,226 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 17 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:16,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336732199] [2022-07-12 18:23:16,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336732199] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:16,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [576249481] [2022-07-12 18:23:16,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:23:16,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:16,227 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:16,232 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:16,233 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-12 18:23:16,381 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:23:16,382 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:16,385 INFO L263 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-12 18:23:16,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:16,391 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 10 treesize of output 8 [2022-07-12 18:23:16,690 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 14 treesize of output 10 [2022-07-12 18:23:16,822 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 17 treesize of output 19 [2022-07-12 18:23:16,901 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 17 treesize of output 19 [2022-07-12 18:23:16,975 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 17 treesize of output 19 [2022-07-12 18:23:17,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:23:17,146 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 17 treesize of output 19 [2022-07-12 18:23:17,237 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 17 treesize of output 19 [2022-07-12 18:23:17,327 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 17 treesize of output 19 [2022-07-12 18:23:17,418 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 17 treesize of output 19 [2022-07-12 18:23:17,534 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:17,534 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 18 treesize of output 18 [2022-07-12 18:23:17,668 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:17,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:18,070 WARN L833 $PredicateComparison]: unable to prove that (or (and (<= (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6) (select |c_#length| |c_ULTIMATE.start_cstpcpy_~from#1.base|)) (<= 0 (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|))) (forall ((v_ArrVal_1254 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1254) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0))) is different from false [2022-07-12 18:23:18,460 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpcpy_~from#1.offset_179| Int) (v_ArrVal_1254 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstpcpy_~from#1.offset_179|)) (<= (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_179| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstpcpy_~from#1.offset_179|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1254) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstpcpy_~from#1.offset_179| 8)) 0))) is different from false [2022-07-12 18:23:18,468 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:18,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:18,474 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:18,474 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 37 treesize of output 37 [2022-07-12 18:23:18,478 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 11 treesize of output 7 [2022-07-12 18:23:18,481 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 16 treesize of output 12 [2022-07-12 18:23:19,079 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 33 not checked. [2022-07-12 18:23:19,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [576249481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:19,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:19,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26, 26] total 75 [2022-07-12 18:23:19,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509173935] [2022-07-12 18:23:19,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:19,082 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 18:23:19,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:19,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 18:23:19,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=447, Invalid=4814, Unknown=3, NotChecked=286, Total=5550 [2022-07-12 18:23:19,084 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 75 states have internal predecessors, (235), 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-12 18:23:20,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:20,946 INFO L93 Difference]: Finished difference Result 132 states and 133 transitions. [2022-07-12 18:23:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 18:23:20,948 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 75 states have internal predecessors, (235), 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 81 [2022-07-12 18:23:20,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:20,948 INFO L225 Difference]: With dead ends: 132 [2022-07-12 18:23:20,948 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 18:23:20,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 144 SyntacticMatches, 15 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 2216 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=894, Invalid=9011, Unknown=3, NotChecked=394, Total=10302 [2022-07-12 18:23:20,949 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 146 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 687 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 712 SdHoareTripleChecker+Invalid, 1226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 516 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:20,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 712 Invalid, 1226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 687 Invalid, 0 Unknown, 516 Unchecked, 0.3s Time] [2022-07-12 18:23:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 18:23:20,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 91. [2022-07-12 18:23:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 89 states have (on average 1.0337078651685394) internal successors, (92), 90 states have internal predecessors, (92), 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-12 18:23:20,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-07-12 18:23:20,952 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 81 [2022-07-12 18:23:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:20,952 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-07-12 18:23:20,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.1333333333333333) internal successors, (235), 75 states have internal predecessors, (235), 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-12 18:23:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-07-12 18:23:20,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 18:23:20,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:20,954 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:20,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:21,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:21,167 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:21,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:21,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1240827014, now seen corresponding path program 6 times [2022-07-12 18:23:21,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:21,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815898575] [2022-07-12 18:23:21,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:21,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:21,539 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 120 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:21,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:21,539 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815898575] [2022-07-12 18:23:21,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815898575] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:21,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249627345] [2022-07-12 18:23:21,540 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:23:21,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:21,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:21,544 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:21,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-12 18:23:22,145 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 11 check-sat command(s) [2022-07-12 18:23:22,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:22,150 INFO L263 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-12 18:23:22,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:22,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:22,170 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 9 treesize of output 11 [2022-07-12 18:23:22,174 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 10 treesize of output 8 [2022-07-12 18:23:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 153 proven. 199 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:22,970 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:23,856 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 190 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:23,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249627345] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:23,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:23,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 66 [2022-07-12 18:23:23,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124090239] [2022-07-12 18:23:23,856 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:23,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-12 18:23:23,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:23,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-12 18:23:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=3824, Unknown=0, NotChecked=0, Total=4422 [2022-07-12 18:23:23,858 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 67 states, 66 states have (on average 3.787878787878788) internal successors, (250), 67 states have internal predecessors, (250), 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-12 18:23:24,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:24,929 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-12 18:23:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-12 18:23:24,930 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 66 states have (on average 3.787878787878788) internal successors, (250), 67 states have internal predecessors, (250), 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 86 [2022-07-12 18:23:24,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:24,930 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:23:24,930 INFO L226 Difference]: Without dead ends: 94 [2022-07-12 18:23:24,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1605 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1480, Invalid=6176, Unknown=0, NotChecked=0, Total=7656 [2022-07-12 18:23:24,931 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 385 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 1001 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 385 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 1114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1001 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:24,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [385 Valid, 368 Invalid, 1114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1001 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:23:24,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-12 18:23:24,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2022-07-12 18:23:24,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 90 states have (on average 1.0333333333333334) internal successors, (93), 91 states have internal predecessors, (93), 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-12 18:23:24,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-12 18:23:24,933 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 86 [2022-07-12 18:23:24,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:24,934 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-12 18:23:24,934 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 66 states have (on average 3.787878787878788) internal successors, (250), 67 states have internal predecessors, (250), 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-12 18:23:24,934 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-12 18:23:24,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-12 18:23:24,934 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:24,935 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:24,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:25,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 18:23:25,143 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:25,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:25,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1305948504, now seen corresponding path program 15 times [2022-07-12 18:23:25,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:25,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098809323] [2022-07-12 18:23:25,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:25,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:25,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:25,781 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 19 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:25,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:25,781 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098809323] [2022-07-12 18:23:25,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098809323] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:25,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922383630] [2022-07-12 18:23:25,782 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:23:25,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:25,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:25,783 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:25,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-12 18:23:26,761 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-12 18:23:26,761 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:26,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 121 conjunts are in the unsatisfiable core [2022-07-12 18:23:26,770 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:26,788 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:23:26,788 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:23:26,793 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 10 treesize of output 8 [2022-07-12 18:23:27,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:23:27,350 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-12 18:23:27,367 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-12 18:23:27,414 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-12 18:23:27,460 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-12 18:23:27,520 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-12 18:23:27,567 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-12 18:23:27,617 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-12 18:23:27,666 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-12 18:23:27,716 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-12 18:23:27,770 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-12 18:23:27,814 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-12 18:23:27,816 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 19 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:27,816 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:27,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:23:27,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:27,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:23:27,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:23:27,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:27,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:23:27,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:27,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:23:27,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1456) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:23:27,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1456 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1456) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:23:27,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:27,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:27,952 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:27,952 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 37 treesize of output 37 [2022-07-12 18:23:27,956 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 11 treesize of output 7 [2022-07-12 18:23:28,744 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 19 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 170 not checked. [2022-07-12 18:23:28,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922383630] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:28,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:28,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 27, 28] total 72 [2022-07-12 18:23:28,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883809684] [2022-07-12 18:23:28,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:28,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 18:23:28,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:28,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 18:23:28,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=3610, Unknown=10, NotChecked=1290, Total=5112 [2022-07-12 18:23:28,747 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 72 states, 72 states have (on average 3.4027777777777777) internal successors, (245), 72 states have internal predecessors, (245), 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-12 18:23:30,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:30,818 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-12 18:23:30,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 18:23:30,819 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.4027777777777777) internal successors, (245), 72 states have internal predecessors, (245), 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 89 [2022-07-12 18:23:30,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:30,819 INFO L225 Difference]: With dead ends: 140 [2022-07-12 18:23:30,820 INFO L226 Difference]: Without dead ends: 99 [2022-07-12 18:23:30,820 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 141 SyntacticMatches, 10 SemanticMatches, 94 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 1232 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=389, Invalid=6951, Unknown=10, NotChecked=1770, Total=9120 [2022-07-12 18:23:30,821 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 74 mSDsluCounter, 1059 mSDsCounter, 0 mSdLazyCounter, 2868 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 2868 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 716 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:30,821 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 1085 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 2868 Invalid, 0 Unknown, 716 Unchecked, 1.0s Time] [2022-07-12 18:23:30,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-12 18:23:30,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2022-07-12 18:23:30,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 94 states have (on average 1.0319148936170213) internal successors, (97), 95 states have internal predecessors, (97), 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-12 18:23:30,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2022-07-12 18:23:30,823 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 89 [2022-07-12 18:23:30,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:30,824 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2022-07-12 18:23:30,824 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.4027777777777777) internal successors, (245), 72 states have internal predecessors, (245), 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-12 18:23:30,824 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2022-07-12 18:23:30,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 18:23:30,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:30,825 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:30,851 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-12 18:23:31,043 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 18:23:31,043 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:31,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1987843371, now seen corresponding path program 16 times [2022-07-12 18:23:31,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:31,044 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955384794] [2022-07-12 18:23:31,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:31,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 153 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:31,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955384794] [2022-07-12 18:23:31,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955384794] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:31,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [948408487] [2022-07-12 18:23:31,519 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:23:31,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:31,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:31,521 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:31,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-12 18:23:31,691 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:23:31,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:31,694 INFO L263 TraceCheckSpWp]: Trace formula consists of 423 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 18:23:31,696 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:32,060 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 200 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:32,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:32,444 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 5 [2022-07-12 18:23:32,481 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 200 proven. 221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:32,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [948408487] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:32,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:32,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 52 [2022-07-12 18:23:32,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543673139] [2022-07-12 18:23:32,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:32,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-12 18:23:32,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:32,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-12 18:23:32,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=2396, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 18:23:32,483 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand has 53 states, 52 states have (on average 3.6923076923076925) internal successors, (192), 53 states have internal predecessors, (192), 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-12 18:23:33,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:33,176 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2022-07-12 18:23:33,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:23:33,179 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 3.6923076923076925) internal successors, (192), 53 states have internal predecessors, (192), 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 93 [2022-07-12 18:23:33,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:33,180 INFO L225 Difference]: With dead ends: 103 [2022-07-12 18:23:33,180 INFO L226 Difference]: Without dead ends: 103 [2022-07-12 18:23:33,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 158 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1040 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=815, Invalid=3475, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 18:23:33,181 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 297 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 1338 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 1429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 1338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:33,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 484 Invalid, 1429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 1338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:23:33,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-12 18:23:33,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2022-07-12 18:23:33,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 97 states have (on average 1.0309278350515463) internal successors, (100), 98 states have internal predecessors, (100), 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-12 18:23:33,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-12 18:23:33,184 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 93 [2022-07-12 18:23:33,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:33,184 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-12 18:23:33,184 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 3.6923076923076925) internal successors, (192), 53 states have internal predecessors, (192), 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-12 18:23:33,185 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-12 18:23:33,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 18:23:33,185 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:33,185 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:33,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:33,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-12 18:23:33,395 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:33,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1493602344, now seen corresponding path program 7 times [2022-07-12 18:23:33,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:33,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054786167] [2022-07-12 18:23:33,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:33,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:33,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:33,807 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 153 proven. 278 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:33,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054786167] [2022-07-12 18:23:33,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054786167] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:33,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679526035] [2022-07-12 18:23:33,807 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:23:33,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:33,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:33,812 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:33,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-12 18:23:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:33,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 18:23:33,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:33,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:33,999 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 9 treesize of output 11 [2022-07-12 18:23:34,002 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 10 treesize of output 8 [2022-07-12 18:23:34,803 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 190 proven. 241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:34,804 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:35,793 INFO L134 CoverageAnalysis]: Checked inductivity of 431 backedges. 231 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:35,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1679526035] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:35,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:35,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 71 [2022-07-12 18:23:35,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674758173] [2022-07-12 18:23:35,793 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:35,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 18:23:35,794 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:35,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 18:23:35,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=600, Invalid=4512, Unknown=0, NotChecked=0, Total=5112 [2022-07-12 18:23:35,795 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 72 states, 71 states have (on average 3.8450704225352115) internal successors, (273), 72 states have internal predecessors, (273), 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-12 18:23:36,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:36,945 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-12 18:23:36,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:23:36,946 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 71 states have (on average 3.8450704225352115) internal successors, (273), 72 states have internal predecessors, (273), 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 94 [2022-07-12 18:23:36,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:36,946 INFO L225 Difference]: With dead ends: 102 [2022-07-12 18:23:36,946 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:23:36,947 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 139 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2009 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1574, Invalid=7356, Unknown=0, NotChecked=0, Total=8930 [2022-07-12 18:23:36,947 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 481 mSDsluCounter, 452 mSDsCounter, 0 mSdLazyCounter, 1359 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 479 SdHoareTripleChecker+Invalid, 1508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 1359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:36,947 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 479 Invalid, 1508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 1359 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:23:36,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:23:36,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 100. [2022-07-12 18:23:36,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 98 states have (on average 1.030612244897959) internal successors, (101), 99 states have internal predecessors, (101), 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-12 18:23:36,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 101 transitions. [2022-07-12 18:23:36,949 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 101 transitions. Word has length 94 [2022-07-12 18:23:36,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:36,949 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 101 transitions. [2022-07-12 18:23:36,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 71 states have (on average 3.8450704225352115) internal successors, (273), 72 states have internal predecessors, (273), 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-12 18:23:36,949 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 101 transitions. [2022-07-12 18:23:36,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 18:23:36,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:36,950 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:36,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-07-12 18:23:37,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-12 18:23:37,151 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:37,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:37,151 INFO L85 PathProgramCache]: Analyzing trace with hash 46237638, now seen corresponding path program 17 times [2022-07-12 18:23:37,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:37,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533301300] [2022-07-12 18:23:37,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:37,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:37,833 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:37,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:37,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533301300] [2022-07-12 18:23:37,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533301300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:37,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234255821] [2022-07-12 18:23:37,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:23:37,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:37,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:37,836 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:37,865 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-12 18:23:39,511 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-12 18:23:39,511 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:39,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-12 18:23:39,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:39,526 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 10 treesize of output 8 [2022-07-12 18:23:39,960 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 14 treesize of output 10 [2022-07-12 18:23:40,056 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 17 treesize of output 19 [2022-07-12 18:23:40,100 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 16 treesize of output 18 [2022-07-12 18:23:40,113 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 16 treesize of output 18 [2022-07-12 18:23:40,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 16 treesize of output 18 [2022-07-12 18:23:40,137 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 16 treesize of output 18 [2022-07-12 18:23:40,149 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 16 treesize of output 18 [2022-07-12 18:23:40,162 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 16 treesize of output 18 [2022-07-12 18:23:40,174 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 16 treesize of output 18 [2022-07-12 18:23:40,187 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 16 treesize of output 18 [2022-07-12 18:23:40,198 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 16 treesize of output 18 [2022-07-12 18:23:40,231 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-12 18:23:40,234 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:40,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:40,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:23:40,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:40,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:23:40,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:23:40,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:40,278 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:23:40,286 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:40,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:23:40,311 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:23:40,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_1772) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:23:40,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1772 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1772) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:23:40,335 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:40,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:40,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:40,340 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 37 treesize of output 37 [2022-07-12 18:23:40,342 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 11 treesize of output 7 [2022-07-12 18:23:40,629 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 21 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2022-07-12 18:23:40,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234255821] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:40,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:40,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30, 30] total 59 [2022-07-12 18:23:40,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980779317] [2022-07-12 18:23:40,630 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:40,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-12 18:23:40,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:40,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-12 18:23:40,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=2143, Unknown=11, NotChecked=1122, Total=3422 [2022-07-12 18:23:40,632 INFO L87 Difference]: Start difference. First operand 100 states and 101 transitions. Second operand has 59 states, 59 states have (on average 3.3389830508474576) internal successors, (197), 59 states have internal predecessors, (197), 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-12 18:23:42,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:42,044 INFO L93 Difference]: Finished difference Result 152 states and 153 transitions. [2022-07-12 18:23:42,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-12 18:23:42,044 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 3.3389830508474576) internal successors, (197), 59 states have internal predecessors, (197), 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 97 [2022-07-12 18:23:42,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:42,045 INFO L225 Difference]: With dead ends: 152 [2022-07-12 18:23:42,045 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:23:42,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 169 SyntacticMatches, 15 SemanticMatches, 74 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 698 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=270, Invalid=3923, Unknown=11, NotChecked=1496, Total=5700 [2022-07-12 18:23:42,045 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 76 mSDsluCounter, 865 mSDsCounter, 0 mSdLazyCounter, 2125 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 2125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1108 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:42,045 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 893 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 2125 Invalid, 0 Unknown, 1108 Unchecked, 0.7s Time] [2022-07-12 18:23:42,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:23:42,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2022-07-12 18:23:42,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 102 states have (on average 1.0294117647058822) internal successors, (105), 103 states have internal predecessors, (105), 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-12 18:23:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 105 transitions. [2022-07-12 18:23:42,047 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 105 transitions. Word has length 97 [2022-07-12 18:23:42,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:42,048 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 105 transitions. [2022-07-12 18:23:42,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 3.3389830508474576) internal successors, (197), 59 states have internal predecessors, (197), 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-12 18:23:42,048 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 105 transitions. [2022-07-12 18:23:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-12 18:23:42,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:42,049 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:42,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:42,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-12 18:23:42,251 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:42,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:42,252 INFO L85 PathProgramCache]: Analyzing trace with hash 1500748617, now seen corresponding path program 18 times [2022-07-12 18:23:42,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:42,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946283032] [2022-07-12 18:23:42,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:42,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:42,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:42,694 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 190 proven. 317 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:42,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:42,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946283032] [2022-07-12 18:23:42,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946283032] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:42,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [954389491] [2022-07-12 18:23:42,695 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:23:42,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:42,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:42,696 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:42,697 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-12 18:23:43,734 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-12 18:23:43,734 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:43,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 18:23:43,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:43,753 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:23:43,754 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:23:44,665 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 231 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:44,665 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:45,824 INFO L134 CoverageAnalysis]: Checked inductivity of 507 backedges. 276 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:45,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [954389491] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:45,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:45,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 78 [2022-07-12 18:23:45,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399484693] [2022-07-12 18:23:45,828 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:45,828 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-12 18:23:45,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:45,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-12 18:23:45,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=821, Invalid=5341, Unknown=0, NotChecked=0, Total=6162 [2022-07-12 18:23:45,831 INFO L87 Difference]: Start difference. First operand 104 states and 105 transitions. Second operand has 79 states, 78 states have (on average 3.782051282051282) internal successors, (295), 79 states have internal predecessors, (295), 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-12 18:23:47,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:47,128 INFO L93 Difference]: Finished difference Result 111 states and 112 transitions. [2022-07-12 18:23:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:23:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.782051282051282) internal successors, (295), 79 states have internal predecessors, (295), 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 101 [2022-07-12 18:23:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:47,129 INFO L225 Difference]: With dead ends: 111 [2022-07-12 18:23:47,129 INFO L226 Difference]: Without dead ends: 111 [2022-07-12 18:23:47,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2311 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2047, Invalid=8665, Unknown=0, NotChecked=0, Total=10712 [2022-07-12 18:23:47,130 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 396 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 1179 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 1303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:47,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 422 Invalid, 1303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1179 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:23:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-07-12 18:23:47,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 107. [2022-07-12 18:23:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 105 states have (on average 1.0285714285714285) internal successors, (108), 106 states have internal predecessors, (108), 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-12 18:23:47,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-12 18:23:47,133 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 101 [2022-07-12 18:23:47,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:47,133 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-12 18:23:47,133 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.782051282051282) internal successors, (295), 79 states have internal predecessors, (295), 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-12 18:23:47,133 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-12 18:23:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-12 18:23:47,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:47,134 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:47,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:47,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:47,359 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:47,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:47,360 INFO L85 PathProgramCache]: Analyzing trace with hash -721433142, now seen corresponding path program 8 times [2022-07-12 18:23:47,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:47,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027213355] [2022-07-12 18:23:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:47,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:47,817 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 190 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:47,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:47,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027213355] [2022-07-12 18:23:47,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027213355] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:47,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [394714957] [2022-07-12 18:23:47,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:23:47,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:47,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:47,821 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:47,822 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-12 18:23:48,023 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:23:48,023 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:48,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-12 18:23:48,029 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:48,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:23:48,036 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 9 treesize of output 11 [2022-07-12 18:23:48,038 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 10 treesize of output 8 [2022-07-12 18:23:48,908 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 231 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:48,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 276 proven. 242 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:50,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [394714957] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:50,043 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:50,043 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 77 [2022-07-12 18:23:50,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064292316] [2022-07-12 18:23:50,043 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:50,044 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-12 18:23:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:50,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-12 18:23:50,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=695, Invalid=5311, Unknown=0, NotChecked=0, Total=6006 [2022-07-12 18:23:50,045 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 78 states, 77 states have (on average 3.857142857142857) internal successors, (297), 78 states have internal predecessors, (297), 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-12 18:23:51,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:51,385 INFO L93 Difference]: Finished difference Result 110 states and 111 transitions. [2022-07-12 18:23:51,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-12 18:23:51,385 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 77 states have (on average 3.857142857142857) internal successors, (297), 78 states have internal predecessors, (297), 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 102 [2022-07-12 18:23:51,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:51,386 INFO L225 Difference]: With dead ends: 110 [2022-07-12 18:23:51,386 INFO L226 Difference]: Without dead ends: 110 [2022-07-12 18:23:51,387 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 151 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1835, Invalid=8671, Unknown=0, NotChecked=0, Total=10506 [2022-07-12 18:23:51,388 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 514 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 1639 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 582 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 1639 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:51,388 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 582 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 1639 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-12 18:23:51,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-07-12 18:23:51,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 108. [2022-07-12 18:23:51,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 106 states have (on average 1.028301886792453) internal successors, (109), 107 states have internal predecessors, (109), 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-12 18:23:51,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-12 18:23:51,390 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 102 [2022-07-12 18:23:51,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:51,390 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-12 18:23:51,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 77 states have (on average 3.857142857142857) internal successors, (297), 78 states have internal predecessors, (297), 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-12 18:23:51,391 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-12 18:23:51,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 18:23:51,391 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:51,391 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:51,411 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:51,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-12 18:23:51,599 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:51,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:51,600 INFO L85 PathProgramCache]: Analyzing trace with hash -198390044, now seen corresponding path program 19 times [2022-07-12 18:23:51,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:51,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [680102271] [2022-07-12 18:23:51,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:51,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:51,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:52,259 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 23 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:52,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [680102271] [2022-07-12 18:23:52,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [680102271] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:52,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294398807] [2022-07-12 18:23:52,260 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:23:52,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:52,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:52,261 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:52,262 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-12 18:23:52,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:52,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 131 conjunts are in the unsatisfiable core [2022-07-12 18:23:52,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:52,442 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 10 treesize of output 8 [2022-07-12 18:23:52,958 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 14 treesize of output 10 [2022-07-12 18:23:53,055 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 17 treesize of output 19 [2022-07-12 18:23:53,090 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 16 treesize of output 18 [2022-07-12 18:23:53,102 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 16 treesize of output 18 [2022-07-12 18:23:53,115 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 16 treesize of output 18 [2022-07-12 18:23:53,126 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 16 treesize of output 18 [2022-07-12 18:23:53,136 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 16 treesize of output 18 [2022-07-12 18:23:53,149 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 16 treesize of output 18 [2022-07-12 18:23:53,161 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 16 treesize of output 18 [2022-07-12 18:23:53,173 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 16 treesize of output 18 [2022-07-12 18:23:53,183 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 16 treesize of output 18 [2022-07-12 18:23:53,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 16 treesize of output 18 [2022-07-12 18:23:53,229 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-12 18:23:53,232 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 23 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:53,232 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:53,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:23:53,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:53,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:23:53,265 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:23:53,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:53,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:23:53,287 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:23:53,294 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:23:53,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:23:53,314 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:23:53,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2115) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-12 18:23:53,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2115 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2115) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:23:53,340 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:53,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:23:53,347 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:23:53,347 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 37 treesize of output 37 [2022-07-12 18:23:53,350 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 11 treesize of output 7 [2022-07-12 18:23:53,711 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 23 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 252 not checked. [2022-07-12 18:23:53,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294398807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:53,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:53,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 63 [2022-07-12 18:23:53,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140346996] [2022-07-12 18:23:53,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:53,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-07-12 18:23:53,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:53,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-07-12 18:23:53,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=2431, Unknown=12, NotChecked=1308, Total=3906 [2022-07-12 18:23:53,712 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 63 states, 63 states have (on average 3.380952380952381) internal successors, (213), 63 states have internal predecessors, (213), 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-12 18:23:55,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:55,317 INFO L93 Difference]: Finished difference Result 164 states and 165 transitions. [2022-07-12 18:23:55,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:23:55,317 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 3.380952380952381) internal successors, (213), 63 states have internal predecessors, (213), 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 105 [2022-07-12 18:23:55,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:55,318 INFO L225 Difference]: With dead ends: 164 [2022-07-12 18:23:55,318 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 18:23:55,319 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 181 SyntacticMatches, 19 SemanticMatches, 79 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 834 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=285, Invalid=4443, Unknown=12, NotChecked=1740, Total=6480 [2022-07-12 18:23:55,319 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 71 mSDsluCounter, 1085 mSDsCounter, 0 mSdLazyCounter, 2665 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 1115 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 2665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1247 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:55,320 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 1115 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 2665 Invalid, 0 Unknown, 1247 Unchecked, 0.9s Time] [2022-07-12 18:23:55,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 18:23:55,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-12 18:23:55,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.0272727272727273) internal successors, (113), 111 states have internal predecessors, (113), 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-12 18:23:55,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-12 18:23:55,322 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 105 [2022-07-12 18:23:55,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:55,322 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-12 18:23:55,323 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 3.380952380952381) internal successors, (213), 63 states have internal predecessors, (213), 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-12 18:23:55,323 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-12 18:23:55,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-12 18:23:55,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:55,323 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:55,343 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:55,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:55,531 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:55,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1814081383, now seen corresponding path program 20 times [2022-07-12 18:23:55,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:55,533 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446319020] [2022-07-12 18:23:55,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:55,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:55,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:55,969 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 231 proven. 370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:55,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446319020] [2022-07-12 18:23:55,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446319020] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:55,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848601465] [2022-07-12 18:23:55,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:23:55,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:55,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:55,971 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:55,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-12 18:23:56,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:23:56,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:23:56,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 18:23:56,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:23:56,642 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 276 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:56,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:23:57,188 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 5 treesize of output 3 [2022-07-12 18:23:57,254 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 276 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:57,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848601465] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:23:57,254 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:23:57,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 30, 30] total 60 [2022-07-12 18:23:57,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675318525] [2022-07-12 18:23:57,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:23:57,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 18:23:57,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:23:57,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 18:23:57,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=379, Invalid=3281, Unknown=0, NotChecked=0, Total=3660 [2022-07-12 18:23:57,256 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 61 states, 60 states have (on average 3.6666666666666665) internal successors, (220), 61 states have internal predecessors, (220), 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-12 18:23:58,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:23:58,557 INFO L93 Difference]: Finished difference Result 119 states and 120 transitions. [2022-07-12 18:23:58,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:23:58,558 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.6666666666666665) internal successors, (220), 61 states have internal predecessors, (220), 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 109 [2022-07-12 18:23:58,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:23:58,558 INFO L225 Difference]: With dead ends: 119 [2022-07-12 18:23:58,558 INFO L226 Difference]: Without dead ends: 119 [2022-07-12 18:23:58,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 183 SyntacticMatches, 2 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1215 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1417, Invalid=6239, Unknown=0, NotChecked=0, Total=7656 [2022-07-12 18:23:58,559 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 489 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 1801 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 1938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 1801 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:23:58,559 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 646 Invalid, 1938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 1801 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:23:58,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-12 18:23:58,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 115. [2022-07-12 18:23:58,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 113 states have (on average 1.0265486725663717) internal successors, (116), 114 states have internal predecessors, (116), 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-12 18:23:58,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-12 18:23:58,561 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 109 [2022-07-12 18:23:58,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:23:58,561 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-12 18:23:58,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.6666666666666665) internal successors, (220), 61 states have internal predecessors, (220), 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-12 18:23:58,561 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-12 18:23:58,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 18:23:58,563 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:23:58,563 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:23:58,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-12 18:23:58,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:58,771 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:23:58,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:23:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash 401948012, now seen corresponding path program 9 times [2022-07-12 18:23:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:23:58,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124980814] [2022-07-12 18:23:58,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:23:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:23:58,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:23:59,201 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 231 proven. 382 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:23:59,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:23:59,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124980814] [2022-07-12 18:23:59,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124980814] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:23:59,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253599267] [2022-07-12 18:23:59,202 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:23:59,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:23:59,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:23:59,203 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:23:59,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-12 18:24:01,331 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2022-07-12 18:24:01,331 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:01,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 527 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 18:24:01,345 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:01,352 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 10 treesize of output 8 [2022-07-12 18:24:01,357 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 9 treesize of output 11 [2022-07-12 18:24:02,336 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 18:24:02,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:03,359 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2022-07-12 18:24:03,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253599267] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:03,359 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:03,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 17, 17] total 60 [2022-07-12 18:24:03,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622048892] [2022-07-12 18:24:03,360 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:03,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-12 18:24:03,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:03,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-12 18:24:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=480, Invalid=3180, Unknown=0, NotChecked=0, Total=3660 [2022-07-12 18:24:03,361 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 61 states, 60 states have (on average 3.7666666666666666) internal successors, (226), 61 states have internal predecessors, (226), 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-12 18:24:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:07,611 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-12 18:24:07,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 18:24:07,611 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.7666666666666666) internal successors, (226), 61 states have internal predecessors, (226), 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 110 [2022-07-12 18:24:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:07,612 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:24:07,612 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:24:07,613 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 188 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=2290, Invalid=10142, Unknown=0, NotChecked=0, Total=12432 [2022-07-12 18:24:07,613 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 396 mSDsluCounter, 715 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 396 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 2291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:07,614 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [396 Valid, 746 Invalid, 2291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 2072 Invalid, 0 Unknown, 109 Unchecked, 0.8s Time] [2022-07-12 18:24:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:24:07,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 164. [2022-07-12 18:24:07,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0925925925925926) internal successors, (177), 163 states have internal predecessors, (177), 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-12 18:24:07,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 177 transitions. [2022-07-12 18:24:07,617 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 177 transitions. Word has length 110 [2022-07-12 18:24:07,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:07,617 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 177 transitions. [2022-07-12 18:24:07,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.7666666666666666) internal successors, (226), 61 states have internal predecessors, (226), 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-12 18:24:07,618 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 177 transitions. [2022-07-12 18:24:07,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-12 18:24:07,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:07,618 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:07,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:07,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-07-12 18:24:07,843 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:07,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash 64398338, now seen corresponding path program 21 times [2022-07-12 18:24:07,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:07,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074510997] [2022-07-12 18:24:07,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:07,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 25 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074510997] [2022-07-12 18:24:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074510997] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [463998786] [2022-07-12 18:24:08,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:24:08,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:08,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:08,603 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:08,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-12 18:24:09,364 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 14 check-sat command(s) [2022-07-12 18:24:09,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:09,370 INFO L263 TraceCheckSpWp]: Trace formula consists of 558 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-12 18:24:09,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:09,377 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 10 treesize of output 8 [2022-07-12 18:24:09,918 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 14 treesize of output 10 [2022-07-12 18:24:10,024 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 17 treesize of output 19 [2022-07-12 18:24:10,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:24:10,076 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 16 treesize of output 18 [2022-07-12 18:24:10,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:24:10,118 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 16 treesize of output 18 [2022-07-12 18:24:10,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 16 treesize of output 18 [2022-07-12 18:24:10,150 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 16 treesize of output 18 [2022-07-12 18:24:10,165 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 16 treesize of output 18 [2022-07-12 18:24:10,179 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 16 treesize of output 18 [2022-07-12 18:24:10,194 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 16 treesize of output 18 [2022-07-12 18:24:10,206 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 16 treesize of output 18 [2022-07-12 18:24:10,217 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 16 treesize of output 18 [2022-07-12 18:24:10,224 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-12 18:24:10,226 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 25 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:10,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:10,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:24:10,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:10,277 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:24:10,288 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:24:10,298 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:10,308 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:24:10,318 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)))) is different from false [2022-07-12 18:24:10,328 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:24:10,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:24:10,347 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:24:10,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-12 18:24:10,365 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2479) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-12 18:24:10,375 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2479 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2479) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:24:10,379 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:10,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:24:10,385 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:10,386 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 37 treesize of output 37 [2022-07-12 18:24:10,389 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 11 treesize of output 7 [2022-07-12 18:24:10,828 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 25 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 299 not checked. [2022-07-12 18:24:10,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [463998786] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:10,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:10,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 33, 34] total 67 [2022-07-12 18:24:10,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520241885] [2022-07-12 18:24:10,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:10,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-07-12 18:24:10,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:10,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-07-12 18:24:10,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=164, Invalid=2737, Unknown=13, NotChecked=1508, Total=4422 [2022-07-12 18:24:10,830 INFO L87 Difference]: Start difference. First operand 164 states and 177 transitions. Second operand has 67 states, 67 states have (on average 3.4029850746268657) internal successors, (228), 67 states have internal predecessors, (228), 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-12 18:24:12,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:12,535 INFO L93 Difference]: Finished difference Result 224 states and 237 transitions. [2022-07-12 18:24:12,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-12 18:24:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 3.4029850746268657) internal successors, (228), 67 states have internal predecessors, (228), 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 113 [2022-07-12 18:24:12,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:12,536 INFO L225 Difference]: With dead ends: 224 [2022-07-12 18:24:12,536 INFO L226 Difference]: Without dead ends: 171 [2022-07-12 18:24:12,536 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 197 SyntacticMatches, 19 SemanticMatches, 83 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 871 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=284, Invalid=4867, Unknown=13, NotChecked=1976, Total=7140 [2022-07-12 18:24:12,536 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 81 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 2920 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1193 SdHoareTripleChecker+Invalid, 4477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 2920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1525 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:12,537 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1193 Invalid, 4477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 2920 Invalid, 0 Unknown, 1525 Unchecked, 1.0s Time] [2022-07-12 18:24:12,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-12 18:24:12,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 168. [2022-07-12 18:24:12,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.0903614457831325) internal successors, (181), 167 states have internal predecessors, (181), 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-12 18:24:12,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 181 transitions. [2022-07-12 18:24:12,540 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 181 transitions. Word has length 113 [2022-07-12 18:24:12,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:12,540 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 181 transitions. [2022-07-12 18:24:12,541 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 3.4029850746268657) internal successors, (228), 67 states have internal predecessors, (228), 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-12 18:24:12,541 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 181 transitions. [2022-07-12 18:24:12,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 18:24:12,541 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:12,541 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:12,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:12,760 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-07-12 18:24:12,760 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:12,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:12,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1729146491, now seen corresponding path program 22 times [2022-07-12 18:24:12,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:12,761 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501707802] [2022-07-12 18:24:12,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:12,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:13,314 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:13,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:13,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501707802] [2022-07-12 18:24:13,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501707802] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:13,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126572259] [2022-07-12 18:24:13,314 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:24:13,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:13,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:13,315 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:13,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-12 18:24:13,508 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:24:13,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:13,511 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-12 18:24:13,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:13,990 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 338 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:13,990 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:14,526 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 5 [2022-07-12 18:24:14,594 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 338 proven. 365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:14,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126572259] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:14,595 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:14,595 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31, 31] total 64 [2022-07-12 18:24:14,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652624584] [2022-07-12 18:24:14,595 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:14,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-12 18:24:14,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:14,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-12 18:24:14,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=3626, Unknown=0, NotChecked=0, Total=4160 [2022-07-12 18:24:14,597 INFO L87 Difference]: Start difference. First operand 168 states and 181 transitions. Second operand has 65 states, 64 states have (on average 3.75) internal successors, (240), 65 states have internal predecessors, (240), 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-12 18:24:15,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:15,719 INFO L93 Difference]: Finished difference Result 168 states and 180 transitions. [2022-07-12 18:24:15,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-12 18:24:15,719 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 3.75) internal successors, (240), 65 states have internal predecessors, (240), 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 117 [2022-07-12 18:24:15,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:15,720 INFO L225 Difference]: With dead ends: 168 [2022-07-12 18:24:15,720 INFO L226 Difference]: Without dead ends: 168 [2022-07-12 18:24:15,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1619 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1214, Invalid=5266, Unknown=0, NotChecked=0, Total=6480 [2022-07-12 18:24:15,721 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 553 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:15,721 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 816 Invalid, 2431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 18:24:15,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-07-12 18:24:15,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2022-07-12 18:24:15,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 166 states have (on average 1.0843373493975903) internal successors, (180), 167 states have internal predecessors, (180), 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-12 18:24:15,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 180 transitions. [2022-07-12 18:24:15,723 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 180 transitions. Word has length 117 [2022-07-12 18:24:15,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:15,723 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 180 transitions. [2022-07-12 18:24:15,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 3.75) internal successors, (240), 65 states have internal predecessors, (240), 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-12 18:24:15,723 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 180 transitions. [2022-07-12 18:24:15,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-12 18:24:15,724 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:15,724 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:15,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:15,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-12 18:24:15,924 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:15,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:15,925 INFO L85 PathProgramCache]: Analyzing trace with hash 103483168, now seen corresponding path program 23 times [2022-07-12 18:24:15,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:15,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424413235] [2022-07-12 18:24:15,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:15,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:15,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:16,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:16,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424413235] [2022-07-12 18:24:16,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424413235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:16,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1628479246] [2022-07-12 18:24:16,715 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:24:16,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:16,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:16,717 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:16,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-12 18:24:19,606 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2022-07-12 18:24:19,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:19,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 595 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-12 18:24:19,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:19,628 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 10 treesize of output 8 [2022-07-12 18:24:20,303 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 14 treesize of output 10 [2022-07-12 18:24:20,419 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 17 treesize of output 19 [2022-07-12 18:24:20,472 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 16 treesize of output 18 [2022-07-12 18:24:20,487 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 16 treesize of output 18 [2022-07-12 18:24:20,502 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 16 treesize of output 18 [2022-07-12 18:24:20,516 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 16 treesize of output 18 [2022-07-12 18:24:20,532 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 16 treesize of output 18 [2022-07-12 18:24:20,549 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 16 treesize of output 18 [2022-07-12 18:24:20,564 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 16 treesize of output 18 [2022-07-12 18:24:20,579 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 16 treesize of output 18 [2022-07-12 18:24:20,594 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 16 treesize of output 18 [2022-07-12 18:24:20,610 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 16 treesize of output 18 [2022-07-12 18:24:20,625 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 16 treesize of output 18 [2022-07-12 18:24:20,639 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 16 treesize of output 18 [2022-07-12 18:24:20,688 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-12 18:24:20,692 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:20,692 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:20,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:24:20,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:20,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:24:20,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:24:20,751 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:20,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)))) is different from false [2022-07-12 18:24:20,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)))) is different from false [2022-07-12 18:24:20,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:24:20,787 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:24:20,795 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:24:20,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-12 18:24:20,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-12 18:24:20,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_2745) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-12 18:24:20,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2745 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2745) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:24:20,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:20,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:24:20,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:20,840 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 37 treesize of output 37 [2022-07-12 18:24:20,843 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 11 treesize of output 7 [2022-07-12 18:24:21,335 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 27 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 350 not checked. [2022-07-12 18:24:21,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1628479246] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:21,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:21,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 36, 36] total 71 [2022-07-12 18:24:21,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783019819] [2022-07-12 18:24:21,336 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:21,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-07-12 18:24:21,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:21,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-07-12 18:24:21,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3061, Unknown=14, NotChecked=1722, Total=4970 [2022-07-12 18:24:21,337 INFO L87 Difference]: Start difference. First operand 168 states and 180 transitions. Second operand has 71 states, 71 states have (on average 3.4507042253521125) internal successors, (245), 71 states have internal predecessors, (245), 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-12 18:24:23,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:23,473 INFO L93 Difference]: Finished difference Result 232 states and 244 transitions. [2022-07-12 18:24:23,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 18:24:23,474 INFO L78 Accepts]: Start accepts. Automaton has has 71 states, 71 states have (on average 3.4507042253521125) internal successors, (245), 71 states have internal predecessors, (245), 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 121 [2022-07-12 18:24:23,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:23,475 INFO L225 Difference]: With dead ends: 232 [2022-07-12 18:24:23,475 INFO L226 Difference]: Without dead ends: 175 [2022-07-12 18:24:23,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 209 SyntacticMatches, 23 SemanticMatches, 88 ConstructedPredicates, 14 IntricatePredicates, 0 DeprecatedPredicates, 1021 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=299, Invalid=5443, Unknown=14, NotChecked=2254, Total=8010 [2022-07-12 18:24:23,476 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 77 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 3918 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 1544 SdHoareTripleChecker+Invalid, 5655 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 3918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1704 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:23,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 1544 Invalid, 5655 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 3918 Invalid, 0 Unknown, 1704 Unchecked, 1.3s Time] [2022-07-12 18:24:23,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-12 18:24:23,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-12 18:24:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.0823529411764705) internal successors, (184), 171 states have internal predecessors, (184), 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-12 18:24:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 184 transitions. [2022-07-12 18:24:23,479 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 184 transitions. Word has length 121 [2022-07-12 18:24:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:23,480 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 184 transitions. [2022-07-12 18:24:23,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 3.4507042253521125) internal successors, (245), 71 states have internal predecessors, (245), 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-12 18:24:23,480 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 184 transitions. [2022-07-12 18:24:23,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-12 18:24:23,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:23,481 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:23,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:23,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:23,703 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:23,704 INFO L85 PathProgramCache]: Analyzing trace with hash 558596515, now seen corresponding path program 24 times [2022-07-12 18:24:23,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:23,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193079936] [2022-07-12 18:24:23,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:23,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:24,293 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 325 proven. 488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:24,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:24,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193079936] [2022-07-12 18:24:24,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193079936] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:24,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752216115] [2022-07-12 18:24:24,294 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:24:24,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:24,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:24,295 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:24,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-12 18:24:33,882 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-07-12 18:24:33,882 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:33,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-12 18:24:33,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:33,918 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:24:33,919 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:24:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 378 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:35,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:36,857 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 435 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:36,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752216115] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:36,858 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:36,858 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 33, 33] total 96 [2022-07-12 18:24:36,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412405444] [2022-07-12 18:24:36,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:36,858 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-07-12 18:24:36,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:36,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-07-12 18:24:36,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1223, Invalid=8089, Unknown=0, NotChecked=0, Total=9312 [2022-07-12 18:24:36,860 INFO L87 Difference]: Start difference. First operand 172 states and 184 transitions. Second operand has 97 states, 96 states have (on average 3.8229166666666665) internal successors, (367), 97 states have internal predecessors, (367), 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-12 18:24:38,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:38,532 INFO L93 Difference]: Finished difference Result 172 states and 183 transitions. [2022-07-12 18:24:38,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-12 18:24:38,533 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 96 states have (on average 3.8229166666666665) internal successors, (367), 97 states have internal predecessors, (367), 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 125 [2022-07-12 18:24:38,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:38,534 INFO L225 Difference]: With dead ends: 172 [2022-07-12 18:24:38,534 INFO L226 Difference]: Without dead ends: 172 [2022-07-12 18:24:38,535 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3610 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=3070, Invalid=13186, Unknown=0, NotChecked=0, Total=16256 [2022-07-12 18:24:38,535 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 706 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 1183 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 706 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 1382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:38,535 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [706 Valid, 411 Invalid, 1382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1183 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:24:38,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-07-12 18:24:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-07-12 18:24:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 170 states have (on average 1.076470588235294) internal successors, (183), 171 states have internal predecessors, (183), 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-12 18:24:38,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 183 transitions. [2022-07-12 18:24:38,538 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 183 transitions. Word has length 125 [2022-07-12 18:24:38,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:38,538 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 183 transitions. [2022-07-12 18:24:38,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 96 states have (on average 3.8229166666666665) internal successors, (367), 97 states have internal predecessors, (367), 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-12 18:24:38,539 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 183 transitions. [2022-07-12 18:24:38,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 18:24:38,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:38,540 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:38,567 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:38,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-12 18:24:38,740 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:38,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:38,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1500121026, now seen corresponding path program 25 times [2022-07-12 18:24:38,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:38,741 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24579765] [2022-07-12 18:24:38,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:38,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:39,693 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 29 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:39,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:39,693 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24579765] [2022-07-12 18:24:39,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24579765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:39,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239496006] [2022-07-12 18:24:39,694 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:24:39,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:39,695 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:39,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-12 18:24:39,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:39,921 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-12 18:24:39,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:39,928 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 10 treesize of output 8 [2022-07-12 18:24:40,599 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 14 treesize of output 10 [2022-07-12 18:24:40,711 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 17 treesize of output 19 [2022-07-12 18:24:40,750 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 16 treesize of output 18 [2022-07-12 18:24:40,761 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 16 treesize of output 18 [2022-07-12 18:24:40,772 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 16 treesize of output 18 [2022-07-12 18:24:40,785 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 16 treesize of output 18 [2022-07-12 18:24:40,796 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 16 treesize of output 18 [2022-07-12 18:24:40,806 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 16 treesize of output 18 [2022-07-12 18:24:40,818 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 16 treesize of output 18 [2022-07-12 18:24:40,829 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 16 treesize of output 18 [2022-07-12 18:24:40,840 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 16 treesize of output 18 [2022-07-12 18:24:40,850 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 16 treesize of output 18 [2022-07-12 18:24:40,860 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 16 treesize of output 18 [2022-07-12 18:24:40,871 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 16 treesize of output 18 [2022-07-12 18:24:40,881 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 16 treesize of output 18 [2022-07-12 18:24:40,921 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-12 18:24:40,923 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 29 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:40,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:40,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:24:40,936 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:40,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:24:40,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-12 18:24:40,962 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:40,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:24:40,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:40,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-12 18:24:40,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:24:41,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:24:41,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-12 18:24:41,025 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)))) is different from false [2022-07-12 18:24:41,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-12 18:24:41,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3029) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-12 18:24:41,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3029 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3029) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:24:41,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:41,050 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:24:41,055 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:41,055 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 37 treesize of output 37 [2022-07-12 18:24:41,057 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 11 treesize of output 7 [2022-07-12 18:24:41,572 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 29 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 405 not checked. [2022-07-12 18:24:41,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239496006] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:41,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:41,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 38, 38] total 75 [2022-07-12 18:24:41,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974709226] [2022-07-12 18:24:41,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:41,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 18:24:41,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:41,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 18:24:41,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=3403, Unknown=15, NotChecked=1950, Total=5550 [2022-07-12 18:24:41,574 INFO L87 Difference]: Start difference. First operand 172 states and 183 transitions. Second operand has 75 states, 75 states have (on average 3.48) internal successors, (261), 75 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:43,927 INFO L93 Difference]: Finished difference Result 240 states and 251 transitions. [2022-07-12 18:24:43,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-07-12 18:24:43,927 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 3.48) internal successors, (261), 75 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-12 18:24:43,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:43,928 INFO L225 Difference]: With dead ends: 240 [2022-07-12 18:24:43,928 INFO L226 Difference]: Without dead ends: 179 [2022-07-12 18:24:43,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 223 SyntacticMatches, 25 SemanticMatches, 93 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 1137 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=314, Invalid=6051, Unknown=15, NotChecked=2550, Total=8930 [2022-07-12 18:24:43,928 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 83 mSDsluCounter, 1672 mSDsCounter, 0 mSdLazyCounter, 4371 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1708 SdHoareTripleChecker+Invalid, 6388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 4371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1982 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:43,929 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1708 Invalid, 6388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 4371 Invalid, 0 Unknown, 1982 Unchecked, 1.4s Time] [2022-07-12 18:24:43,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-07-12 18:24:43,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2022-07-12 18:24:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.0747126436781609) internal successors, (187), 175 states have internal predecessors, (187), 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-12 18:24:43,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 187 transitions. [2022-07-12 18:24:43,932 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 187 transitions. Word has length 129 [2022-07-12 18:24:43,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:43,932 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 187 transitions. [2022-07-12 18:24:43,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 3.48) internal successors, (261), 75 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:43,932 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 187 transitions. [2022-07-12 18:24:43,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-12 18:24:43,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:43,933 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:43,954 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-12 18:24:44,148 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:44,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 497106881, now seen corresponding path program 26 times [2022-07-12 18:24:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:44,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668376239] [2022-07-12 18:24:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:44,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:44,744 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 378 proven. 553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:44,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:44,744 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668376239] [2022-07-12 18:24:44,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668376239] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:44,745 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343950601] [2022-07-12 18:24:44,745 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:24:44,745 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:44,745 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:44,747 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:44,747 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-12 18:24:44,980 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:24:44,981 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:44,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 646 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-12 18:24:44,987 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:45,684 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 435 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:45,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:46,435 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 5 treesize of output 3 [2022-07-12 18:24:46,515 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 435 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:46,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343950601] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:46,515 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:46,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 36, 36] total 72 [2022-07-12 18:24:46,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1366803708] [2022-07-12 18:24:46,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:46,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-12 18:24:46,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:46,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-12 18:24:46,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=4724, Unknown=0, NotChecked=0, Total=5256 [2022-07-12 18:24:46,517 INFO L87 Difference]: Start difference. First operand 176 states and 187 transitions. Second operand has 73 states, 72 states have (on average 3.7222222222222223) internal successors, (268), 73 states have internal predecessors, (268), 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-12 18:24:48,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:48,320 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2022-07-12 18:24:48,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 18:24:48,321 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 3.7222222222222223) internal successors, (268), 73 states have internal predecessors, (268), 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 133 [2022-07-12 18:24:48,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:48,322 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:24:48,322 INFO L226 Difference]: Without dead ends: 176 [2022-07-12 18:24:48,323 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1782 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2047, Invalid=9083, Unknown=0, NotChecked=0, Total=11130 [2022-07-12 18:24:48,323 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 514 mSDsluCounter, 909 mSDsCounter, 0 mSdLazyCounter, 2661 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 2821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:48,324 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 946 Invalid, 2821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2661 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 18:24:48,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-12 18:24:48,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 176. [2022-07-12 18:24:48,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.0689655172413792) internal successors, (186), 175 states have internal predecessors, (186), 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-12 18:24:48,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 186 transitions. [2022-07-12 18:24:48,327 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 186 transitions. Word has length 133 [2022-07-12 18:24:48,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:48,327 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 186 transitions. [2022-07-12 18:24:48,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 3.7222222222222223) internal successors, (268), 73 states have internal predecessors, (268), 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-12 18:24:48,328 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 186 transitions. [2022-07-12 18:24:48,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 18:24:48,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:48,329 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:48,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-07-12 18:24:48,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:48,535 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:24:48,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:48,536 INFO L85 PathProgramCache]: Analyzing trace with hash -410814628, now seen corresponding path program 27 times [2022-07-12 18:24:48,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:48,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699256880] [2022-07-12 18:24:48,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:48,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:49,473 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 31 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:49,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:49,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699256880] [2022-07-12 18:24:49,473 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699256880] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:49,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165536963] [2022-07-12 18:24:49,474 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:24:49,474 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:49,474 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:49,475 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:24:49,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-12 18:24:55,442 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 17 check-sat command(s) [2022-07-12 18:24:55,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:24:55,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 669 conjuncts, 167 conjunts are in the unsatisfiable core [2022-07-12 18:24:55,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:55,474 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 10 treesize of output 8 [2022-07-12 18:24:56,235 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 14 treesize of output 10 [2022-07-12 18:24:56,357 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 17 treesize of output 19 [2022-07-12 18:24:56,412 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 16 treesize of output 18 [2022-07-12 18:24:56,426 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 16 treesize of output 18 [2022-07-12 18:24:56,440 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 16 treesize of output 18 [2022-07-12 18:24:56,454 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 16 treesize of output 18 [2022-07-12 18:24:56,469 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 16 treesize of output 18 [2022-07-12 18:24:56,483 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 16 treesize of output 18 [2022-07-12 18:24:56,497 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 16 treesize of output 18 [2022-07-12 18:24:56,514 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 16 treesize of output 18 [2022-07-12 18:24:56,530 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 16 treesize of output 18 [2022-07-12 18:24:56,545 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 16 treesize of output 18 [2022-07-12 18:24:56,560 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 16 treesize of output 18 [2022-07-12 18:24:56,575 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 16 treesize of output 18 [2022-07-12 18:24:56,593 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 16 treesize of output 18 [2022-07-12 18:24:56,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:24:56,613 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-12 18:24:56,616 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 31 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:24:56,616 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:56,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-12 18:24:56,671 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 2 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:56,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-12 18:24:56,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 4)))) is different from false [2022-07-12 18:24:56,698 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 5 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)))) is different from false [2022-07-12 18:24:56,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-12 18:24:56,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstpcpy_~from#1.offset|)) 0)) is different from false [2022-07-12 18:24:56,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 8)))) is different from false [2022-07-12 18:24:56,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-12 18:24:56,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-12 18:24:56,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-12 18:24:56,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-12 18:24:56,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 13)))) is different from false [2022-07-12 18:24:56,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-12 18:24:56,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpcpy_~to#1.base| v_ArrVal_3327) |c_ULTIMATE.start_cstpcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstpcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-12 18:24:56,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3327 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3327) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:24:56,798 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:56,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:24:56,803 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:24:56,804 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 37 treesize of output 37 [2022-07-12 18:24:56,806 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 11 treesize of output 7 [2022-07-12 18:24:57,447 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 31 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 464 not checked. [2022-07-12 18:24:57,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165536963] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:57,448 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:57,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 40] total 79 [2022-07-12 18:24:57,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628699326] [2022-07-12 18:24:57,448 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:57,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-12 18:24:57,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:57,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-12 18:24:57,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=3763, Unknown=16, NotChecked=2192, Total=6162 [2022-07-12 18:24:57,450 INFO L87 Difference]: Start difference. First operand 176 states and 186 transitions. Second operand has 79 states, 79 states have (on average 3.4936708860759493) internal successors, (276), 79 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,090 INFO L93 Difference]: Finished difference Result 248 states and 258 transitions. [2022-07-12 18:25:00,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 18:25:00,091 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 79 states have (on average 3.4936708860759493) internal successors, (276), 79 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-07-12 18:25:00,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,092 INFO L225 Difference]: With dead ends: 248 [2022-07-12 18:25:00,092 INFO L226 Difference]: Without dead ends: 183 [2022-07-12 18:25:00,092 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 235 SyntacticMatches, 29 SemanticMatches, 98 ConstructedPredicates, 16 IntricatePredicates, 0 DeprecatedPredicates, 1305 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=329, Invalid=6691, Unknown=16, NotChecked=2864, Total=9900 [2022-07-12 18:25:00,094 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 56 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 4661 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 1829 SdHoareTripleChecker+Invalid, 6545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1862 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,095 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 1829 Invalid, 6545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4661 Invalid, 0 Unknown, 1862 Unchecked, 1.6s Time] [2022-07-12 18:25:00,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-12 18:25:00,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 180. [2022-07-12 18:25:00,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.0674157303370786) internal successors, (190), 179 states have internal predecessors, (190), 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-12 18:25:00,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 190 transitions. [2022-07-12 18:25:00,098 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 190 transitions. Word has length 137 [2022-07-12 18:25:00,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,099 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 190 transitions. [2022-07-12 18:25:00,099 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 79 states have (on average 3.4936708860759493) internal successors, (276), 79 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,099 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 190 transitions. [2022-07-12 18:25:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 18:25:00,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,100 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,132 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:00,318 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-07-12 18:25:00,319 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:25:00,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,319 INFO L85 PathProgramCache]: Analyzing trace with hash -44266529, now seen corresponding path program 28 times [2022-07-12 18:25:00,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,319 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674184321] [2022-07-12 18:25:00,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:01,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 435 proven. 622 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674184321] [2022-07-12 18:25:01,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674184321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:01,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [564404151] [2022-07-12 18:25:01,062 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:25:01,062 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:01,062 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:01,064 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:25:01,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-12 18:25:01,308 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:25:01,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:01,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 92 conjunts are in the unsatisfiable core [2022-07-12 18:25:01,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:02,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 512 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:02,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:02,870 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 5 [2022-07-12 18:25:02,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 512 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:02,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [564404151] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:02,930 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:02,930 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 37] total 75 [2022-07-12 18:25:02,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481648829] [2022-07-12 18:25:02,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:02,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 76 states [2022-07-12 18:25:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:02,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2022-07-12 18:25:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=587, Invalid=5113, Unknown=0, NotChecked=0, Total=5700 [2022-07-12 18:25:02,932 INFO L87 Difference]: Start difference. First operand 180 states and 190 transitions. Second operand has 76 states, 75 states have (on average 3.84) internal successors, (288), 76 states have internal predecessors, (288), 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-12 18:25:04,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:04,829 INFO L93 Difference]: Finished difference Result 180 states and 189 transitions. [2022-07-12 18:25:04,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-07-12 18:25:04,829 INFO L78 Accepts]: Start accepts. Automaton has has 76 states, 75 states have (on average 3.84) internal successors, (288), 76 states have internal predecessors, (288), 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 141 [2022-07-12 18:25:04,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:04,830 INFO L225 Difference]: With dead ends: 180 [2022-07-12 18:25:04,830 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 18:25:04,831 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1890 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2262, Invalid=9948, Unknown=0, NotChecked=0, Total=12210 [2022-07-12 18:25:04,831 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 708 mSDsluCounter, 879 mSDsCounter, 0 mSdLazyCounter, 2603 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 708 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 2603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:04,831 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [708 Valid, 918 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 2603 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 18:25:04,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 18:25:04,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2022-07-12 18:25:04,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 178 states have (on average 1.0617977528089888) internal successors, (189), 179 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:04,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 189 transitions. [2022-07-12 18:25:04,834 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 189 transitions. Word has length 141 [2022-07-12 18:25:04,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:04,834 INFO L495 AbstractCegarLoop]: Abstraction has 180 states and 189 transitions. [2022-07-12 18:25:04,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 76 states, 75 states have (on average 3.84) internal successors, (288), 76 states have internal predecessors, (288), 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-12 18:25:04,835 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 189 transitions. [2022-07-12 18:25:04,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-12 18:25:04,835 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:04,835 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:04,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:05,047 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:05,048 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:25:05,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1570798470, now seen corresponding path program 29 times [2022-07-12 18:25:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:05,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853195741] [2022-07-12 18:25:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:05,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:06,159 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 33 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:06,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853195741] [2022-07-12 18:25:06,160 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853195741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:06,160 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [321298070] [2022-07-12 18:25:06,160 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:25:06,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:06,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:06,164 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:25:06,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-12 18:25:13,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-12 18:25:13,098 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:13,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 133 conjunts are in the unsatisfiable core [2022-07-12 18:25:13,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:13,126 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 10 treesize of output 8 [2022-07-12 18:25:13,130 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 9 treesize of output 11 [2022-07-12 18:25:13,394 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 15 treesize of output 11 [2022-07-12 18:25:13,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,568 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,906 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:13,966 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,027 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,413 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:25:14,511 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:14,511 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 19 treesize of output 19 [2022-07-12 18:25:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 450 proven. 111 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-07-12 18:25:14,666 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:19,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:19,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-12 18:25:19,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:19,918 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 33 treesize of output 33 [2022-07-12 18:25:19,921 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 9 treesize of output 7 [2022-07-12 18:25:20,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 435 proven. 126 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2022-07-12 18:25:20,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [321298070] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:20,572 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:20,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 25, 25] total 89 [2022-07-12 18:25:20,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870668534] [2022-07-12 18:25:20,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:20,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-12 18:25:20,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:20,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-12 18:25:20,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=760, Invalid=7048, Unknown=24, NotChecked=0, Total=7832 [2022-07-12 18:25:20,574 INFO L87 Difference]: Start difference. First operand 180 states and 189 transitions. Second operand has 89 states, 89 states have (on average 3.359550561797753) internal successors, (299), 89 states have internal predecessors, (299), 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-12 18:25:31,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:31,727 INFO L93 Difference]: Finished difference Result 252 states and 253 transitions. [2022-07-12 18:25:31,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2022-07-12 18:25:31,728 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.359550561797753) internal successors, (299), 89 states have internal predecessors, (299), 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 145 [2022-07-12 18:25:31,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:31,728 INFO L225 Difference]: With dead ends: 252 [2022-07-12 18:25:31,729 INFO L226 Difference]: Without dead ends: 183 [2022-07-12 18:25:31,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 288 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11050 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=6933, Invalid=46173, Unknown=24, NotChecked=0, Total=53130 [2022-07-12 18:25:31,732 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 149 mSDsluCounter, 1195 mSDsCounter, 0 mSdLazyCounter, 5985 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1218 SdHoareTripleChecker+Invalid, 6544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 5985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 370 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:31,732 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1218 Invalid, 6544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 5985 Invalid, 0 Unknown, 370 Unchecked, 2.2s Time] [2022-07-12 18:25:31,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-07-12 18:25:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2022-07-12 18:25:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 182 states have (on average 1.010989010989011) internal successors, (184), 182 states have internal predecessors, (184), 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-12 18:25:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2022-07-12 18:25:31,735 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 145 [2022-07-12 18:25:31,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:31,736 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2022-07-12 18:25:31,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.359550561797753) internal successors, (299), 89 states have internal predecessors, (299), 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-12 18:25:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2022-07-12 18:25:31,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2022-07-12 18:25:31,737 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:31,737 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:31,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:31,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:31,947 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:25:31,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:31,948 INFO L85 PathProgramCache]: Analyzing trace with hash 83984830, now seen corresponding path program 10 times [2022-07-12 18:25:31,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:31,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560060162] [2022-07-12 18:25:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:31,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:32,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:32,753 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 1111 proven. 703 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-12 18:25:32,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560060162] [2022-07-12 18:25:32,753 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560060162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:32,753 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334731232] [2022-07-12 18:25:32,754 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:25:32,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:32,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:32,755 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:25:32,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-12 18:25:33,043 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:25:33,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:33,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 851 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 18:25:33,049 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:33,059 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:25:33,060 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-12 18:25:34,714 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 1159 proven. 630 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 18:25:34,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 1880 backedges. 1141 proven. 648 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2022-07-12 18:25:35,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334731232] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:35,938 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:35,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 103 [2022-07-12 18:25:35,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143227598] [2022-07-12 18:25:35,939 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:35,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 103 states [2022-07-12 18:25:35,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:35,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2022-07-12 18:25:35,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1919, Invalid=8587, Unknown=0, NotChecked=0, Total=10506 [2022-07-12 18:25:35,941 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand has 103 states, 103 states have (on average 3.7864077669902914) internal successors, (390), 103 states have internal predecessors, (390), 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-12 18:25:36,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:36,878 INFO L93 Difference]: Finished difference Result 265 states and 266 transitions. [2022-07-12 18:25:36,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-12 18:25:36,879 INFO L78 Accepts]: Start accepts. Automaton has has 103 states, 103 states have (on average 3.7864077669902914) internal successors, (390), 103 states have internal predecessors, (390), 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 182 [2022-07-12 18:25:36,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:36,879 INFO L225 Difference]: With dead ends: 265 [2022-07-12 18:25:36,880 INFO L226 Difference]: Without dead ends: 190 [2022-07-12 18:25:36,880 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 425 GetRequests, 303 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3797 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=3011, Invalid=11995, Unknown=0, NotChecked=0, Total=15006 [2022-07-12 18:25:36,881 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 179 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:36,881 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 321 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:25:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2022-07-12 18:25:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2022-07-12 18:25:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 186 states have (on average 1.010752688172043) internal successors, (188), 186 states have internal predecessors, (188), 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-12 18:25:36,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2022-07-12 18:25:36,883 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 182 [2022-07-12 18:25:36,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:36,884 INFO L495 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2022-07-12 18:25:36,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 103 states, 103 states have (on average 3.7864077669902914) internal successors, (390), 103 states have internal predecessors, (390), 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-12 18:25:36,884 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2022-07-12 18:25:36,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2022-07-12 18:25:36,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:36,885 INFO L195 NwaCegarLoop]: trace histogram [26, 25, 25, 25, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:36,910 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:37,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-12 18:25:37,099 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-12 18:25:37,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:37,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1527146011, now seen corresponding path program 11 times [2022-07-12 18:25:37,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:37,100 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902331047] [2022-07-12 18:25:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:37,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:37,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:38,058 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 1128 proven. 780 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 18:25:38,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:38,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902331047] [2022-07-12 18:25:38,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902331047] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:38,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [958895327] [2022-07-12 18:25:38,059 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:25:38,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:38,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:38,060 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-12 18:25:38,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process