./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.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_cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:24:56,086 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:24:56,087 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:24:56,126 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:24:56,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:24:56,127 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:24:56,129 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:24:56,130 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:24:56,131 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:24:56,134 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:24:56,135 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:24:56,137 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:24:56,137 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:24:56,139 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:24:56,139 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:24:56,146 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:24:56,147 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:24:56,147 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:24:56,148 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:24:56,149 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:24:56,150 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:24:56,151 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:24:56,151 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:24:56,152 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:24:56,153 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:24:56,158 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:24:56,160 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:24:56,160 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:24:56,161 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:24:56,162 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:24:56,162 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:24:56,163 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:24:56,163 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:24:56,164 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:24:56,164 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:24:56,165 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:24:56,165 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:24:56,165 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:24:56,166 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:24:56,166 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:24:56,167 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:24:56,167 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:24:56,168 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:24:56,185 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:24:56,191 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:24:56,191 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:24:56,191 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:24:56,192 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:24:56,192 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:24:56,192 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:24:56,192 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:24:56,193 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:24:56,193 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:24:56,193 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:24:56,194 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:24:56,195 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:24:56,195 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:24:56,196 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:24:56,196 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:24:56,196 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:24:56,196 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:24:56,196 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:24:56,196 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:24:56,197 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:24:56,197 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:24:56,197 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:24:56,197 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 -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2022-07-12 18:24:56,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:24:56,363 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:24:56,364 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:24:56,365 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:24:56,366 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:24:56,366 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-12 18:24:56,427 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8a25310/94a64c2b855647c2a26e4eb11c65cf29/FLAGe9c5201ac [2022-07-12 18:24:56,803 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:24:56,803 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-12 18:24:56,809 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8a25310/94a64c2b855647c2a26e4eb11c65cf29/FLAGe9c5201ac [2022-07-12 18:24:57,212 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4d8a25310/94a64c2b855647c2a26e4eb11c65cf29 [2022-07-12 18:24:57,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:24:57,214 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:24:57,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:24:57,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:24:57,218 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:24:57,219 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,219 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e9e3d34 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57, skipping insertion in model container [2022-07-12 18:24:57,220 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,224 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:24:57,262 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:24:57,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:24:57,418 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:24:57,469 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:24:57,487 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:24:57,487 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57 WrapperNode [2022-07-12 18:24:57,487 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:24:57,488 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:24:57,488 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:24:57,488 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:24:57,492 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:24:57" (1/1) ... [2022-07-12 18:24:57,500 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:24:57" (1/1) ... [2022-07-12 18:24:57,513 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-07-12 18:24:57,513 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:24:57,514 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:24:57,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:24:57,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:24:57,519 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,519 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,521 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,521 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,525 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,527 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,531 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,532 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:24:57,533 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:24:57,533 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:24:57,533 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:24:57,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (1/1) ... [2022-07-12 18:24:57,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:24:57,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:57,561 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:24:57,563 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:24:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:24:57,585 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:24:57,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:24:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:24:57,587 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:24:57,587 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:24:57,644 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:24:57,645 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:24:57,804 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:24:57,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:24:57,821 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 18:24:57,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:24:57 BoogieIcfgContainer [2022-07-12 18:24:57,823 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:24:57,824 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:24:57,824 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:24:57,826 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:24:57,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:24:57" (1/3) ... [2022-07-12 18:24:57,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00b2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:24:57, skipping insertion in model container [2022-07-12 18:24:57,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:24:57" (2/3) ... [2022-07-12 18:24:57,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e00b2a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:24:57, skipping insertion in model container [2022-07-12 18:24:57,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:24:57" (3/3) ... [2022-07-12 18:24:57,828 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2022-07-12 18:24:57,849 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:24:57,849 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-12 18:24:57,875 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:24:57,879 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@5b060fcd, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c94e845 [2022-07-12 18:24:57,879 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-12 18:24:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 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:57,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:24:57,886 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:57,886 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:57,886 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:57,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:57,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-12 18:24:57,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:57,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189126940] [2022-07-12 18:24:57,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:57,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:57,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,042 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:24:58,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189126940] [2022-07-12 18:24:58,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189126940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,044 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:24:58,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820016907] [2022-07-12 18:24:58,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:24:58,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:24:58,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:24:58,072 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 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:24:58,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,108 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-12 18:24:58,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:24:58,110 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:24:58,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,114 INFO L225 Difference]: With dead ends: 36 [2022-07-12 18:24:58,115 INFO L226 Difference]: Without dead ends: 34 [2022-07-12 18:24:58,117 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:24:58,120 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-12 18:24:58,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-12 18:24:58,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 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:24:58,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-12 18:24:58,146 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2022-07-12 18:24:58,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,147 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-12 18:24:58,147 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:24:58,147 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-12 18:24:58,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:24:58,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,148 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:24:58,148 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-12 18:24:58,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,150 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631748526] [2022-07-12 18:24:58,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,225 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:24:58,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631748526] [2022-07-12 18:24:58,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631748526] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:24:58,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392947840] [2022-07-12 18:24:58,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:24:58,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:24:58,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:24:58,230 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) 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:24:58,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,258 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-12 18:24:58,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:24:58,258 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:24:58,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,260 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:24:58,260 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 18:24:58,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 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:24:58,264 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 18:24:58,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 18:24:58,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 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:24:58,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-12 18:24:58,270 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-12 18:24:58,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,271 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-12 18:24:58,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) 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:24:58,271 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-12 18:24:58,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:24:58,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,272 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:24:58,273 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-12 18:24:58,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006805392] [2022-07-12 18:24:58,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,330 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:24:58,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006805392] [2022-07-12 18:24:58,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006805392] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:24:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065840571] [2022-07-12 18:24:58,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:24:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:24:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:24:58,332 INFO L87 Difference]: Start difference. First operand 33 states and 39 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:24:58,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,345 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-12 18:24:58,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:24:58,346 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:24:58,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,346 INFO L225 Difference]: With dead ends: 59 [2022-07-12 18:24:58,346 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 18:24:58,347 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:24:58,352 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,353 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 18:24:58,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-07-12 18:24:58,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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:58,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-12 18:24:58,360 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2022-07-12 18:24:58,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,360 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-12 18:24:58,360 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:24:58,360 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-12 18:24:58,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:24:58,361 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,361 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:24:58,362 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,364 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-12 18:24:58,364 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514448769] [2022-07-12 18:24:58,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,435 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:24:58,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514448769] [2022-07-12 18:24:58,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514448769] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:24:58,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721992697] [2022-07-12 18:24:58,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,436 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:24:58,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:24:58,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:24:58,438 INFO L87 Difference]: Start difference. First operand 36 states and 43 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:24:58,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,489 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-12 18:24:58,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:24:58,489 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:24:58,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,490 INFO L225 Difference]: With dead ends: 63 [2022-07-12 18:24:58,490 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:24:58,490 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:24:58,491 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,491 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:24:58,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2022-07-12 18:24:58,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 37 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:24:58,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-12 18:24:58,495 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 7 [2022-07-12 18:24:58,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,495 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-12 18:24:58,495 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:24:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-12 18:24:58,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:24:58,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,496 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,496 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:24:58,496 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,497 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751785, now seen corresponding path program 1 times [2022-07-12 18:24:58,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36561983] [2022-07-12 18:24:58,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,533 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:24:58,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36561983] [2022-07-12 18:24:58,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36561983] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:24:58,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988849130] [2022-07-12 18:24:58,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:24:58,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:24:58,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:24:58,536 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:24:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,583 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-12 18:24:58,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:24:58,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:24:58,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,584 INFO L225 Difference]: With dead ends: 39 [2022-07-12 18:24:58,585 INFO L226 Difference]: Without dead ends: 39 [2022-07-12 18:24:58,585 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:24:58,585 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,586 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-12 18:24:58,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-12 18:24:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 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:58,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-12 18:24:58,588 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2022-07-12 18:24:58,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,589 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-12 18:24:58,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:24:58,589 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-12 18:24:58,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:24:58,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,590 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:24:58,590 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751784, now seen corresponding path program 1 times [2022-07-12 18:24:58,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373075551] [2022-07-12 18:24:58,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,661 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:24:58,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [373075551] [2022-07-12 18:24:58,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [373075551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:58,661 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:58,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:24:58,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659741600] [2022-07-12 18:24:58,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:58,662 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:24:58,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:58,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:24:58,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:24:58,663 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:24:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:58,741 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-12 18:24:58,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:24:58,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:24:58,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:58,742 INFO L225 Difference]: With dead ends: 43 [2022-07-12 18:24:58,742 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 18:24:58,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:24:58,743 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:58,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:58,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 18:24:58,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-12 18:24:58,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 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:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-12 18:24:58,746 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-07-12 18:24:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:58,747 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-12 18:24:58,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 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:24:58,747 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-12 18:24:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:24:58,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:58,747 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:58,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:24:58,748 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-12 18:24:58,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:58,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723816081] [2022-07-12 18:24:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:58,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,821 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:24:58,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:58,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723816081] [2022-07-12 18:24:58,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723816081] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:24:58,822 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1798111967] [2022-07-12 18:24:58,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:58,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:58,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:24:58,824 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:24:58,825 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:24:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:58,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:24:58,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:24:58,950 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:24:58,950 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:59,008 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:24:59,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:24:59,116 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:24:59,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1798111967] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:24:59,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:24:59,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-12 18:24:59,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252997988] [2022-07-12 18:24:59,117 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:24:59,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:24:59,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:24:59,118 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,222 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-12 18:24:59,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:24:59,223 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:24:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,223 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:24:59,223 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:24:59,224 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:24:59,224 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,224 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 201 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:24:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:24:59,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-07-12 18:24:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 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:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-12 18:24:59,227 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2022-07-12 18:24:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,227 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-12 18:24:59,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-12 18:24:59,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:24:59,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,254 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:24:59,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:24:59,444 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,444 INFO L85 PathProgramCache]: Analyzing trace with hash -466410634, now seen corresponding path program 1 times [2022-07-12 18:24:59,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341912223] [2022-07-12 18:24:59,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,493 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:24:59,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341912223] [2022-07-12 18:24:59,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341912223] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:24:59,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046049190] [2022-07-12 18:24:59,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:24:59,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:24:59,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:24:59,495 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,516 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-12 18:24:59,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:24:59,517 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:24:59,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,517 INFO L225 Difference]: With dead ends: 73 [2022-07-12 18:24:59,517 INFO L226 Difference]: Without dead ends: 73 [2022-07-12 18:24:59,518 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:24:59,518 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:59,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-12 18:24:59,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-12 18:24:59,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.35) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 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:59,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-12 18:24:59,529 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-12 18:24:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,529 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-12 18:24:59,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-12 18:24:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:24:59,530 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,530 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:24:59,531 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,531 INFO L85 PathProgramCache]: Analyzing trace with hash -467763174, now seen corresponding path program 1 times [2022-07-12 18:24:59,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502906488] [2022-07-12 18:24:59,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,596 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:24:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502906488] [2022-07-12 18:24:59,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502906488] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,596 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:24:59,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333822219] [2022-07-12 18:24:59,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,597 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:24:59,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:24:59,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:24:59,598 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,640 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-12 18:24:59,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:24:59,641 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:24:59,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,641 INFO L225 Difference]: With dead ends: 47 [2022-07-12 18:24:59,641 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 18:24:59,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:24:59,643 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 18:24:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-12 18:24:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 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:24:59,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-12 18:24:59,650 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2022-07-12 18:24:59,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,650 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-12 18:24:59,650 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,650 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-12 18:24:59,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:24:59,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 18:24:59,652 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,652 INFO L85 PathProgramCache]: Analyzing trace with hash -467763173, now seen corresponding path program 1 times [2022-07-12 18:24:59,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292806400] [2022-07-12 18:24:59,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,698 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:24:59,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292806400] [2022-07-12 18:24:59,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292806400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:24:59,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691878302] [2022-07-12 18:24:59,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,699 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:24:59,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:24:59,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:24:59,700 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,760 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-12 18:24:59,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:24:59,760 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:24:59,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,761 INFO L225 Difference]: With dead ends: 47 [2022-07-12 18:24:59,761 INFO L226 Difference]: Without dead ends: 47 [2022-07-12 18:24:59,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:24:59,761 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:59,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-12 18:24:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-12 18:24:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 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:59,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-12 18:24:59,763 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-12 18:24:59,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,763 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-12 18:24:59,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-12 18:24:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:24:59,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,764 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:24:59,764 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,765 INFO L85 PathProgramCache]: Analyzing trace with hash 213647736, now seen corresponding path program 1 times [2022-07-12 18:24:59,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [761628476] [2022-07-12 18:24:59,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,796 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:24:59,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [761628476] [2022-07-12 18:24:59,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [761628476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:24:59,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688507813] [2022-07-12 18:24:59,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:24:59,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:24:59,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:24:59,798 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,812 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-12 18:24:59,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:24:59,812 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-12 18:24:59,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,812 INFO L225 Difference]: With dead ends: 49 [2022-07-12 18:24:59,812 INFO L226 Difference]: Without dead ends: 49 [2022-07-12 18:24:59,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 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:24:59,813 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:59,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-12 18:24:59,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-12 18:24:59,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 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:59,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-12 18:24:59,815 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2022-07-12 18:24:59,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,815 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-12 18:24:59,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,815 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-12 18:24:59,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:24:59,816 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,816 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:24:59,816 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901600, now seen corresponding path program 1 times [2022-07-12 18:24:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276215711] [2022-07-12 18:24:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,837 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:24:59,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276215711] [2022-07-12 18:24:59,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276215711] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:24:59,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973399957] [2022-07-12 18:24:59,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,839 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:24:59,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:24:59,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:24:59,839 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:24:59,867 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-12 18:24:59,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:24:59,875 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:24:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:24:59,877 INFO L225 Difference]: With dead ends: 35 [2022-07-12 18:24:59,877 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 18:24:59,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:24:59,878 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:24:59,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:24:59,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 18:24:59,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-12 18:24:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 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:24:59,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-12 18:24:59,880 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2022-07-12 18:24:59,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:24:59,881 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-12 18:24:59,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:24:59,881 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-12 18:24:59,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:24:59,883 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:24:59,883 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:24:59,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:24:59,883 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:24:59,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:24:59,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901599, now seen corresponding path program 1 times [2022-07-12 18:24:59,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:24:59,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335782905] [2022-07-12 18:24:59,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:24:59,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:24:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:24:59,959 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:24:59,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:24:59,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335782905] [2022-07-12 18:24:59,960 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335782905] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:24:59,960 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:24:59,960 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:24:59,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794083903] [2022-07-12 18:24:59,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:24:59,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:24:59,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:24:59,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:24:59,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:24:59,961 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,005 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-12 18:25:00,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:25:00,006 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:25:00,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,007 INFO L225 Difference]: With dead ends: 69 [2022-07-12 18:25:00,007 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 18:25:00,007 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:25:00,008 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,008 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:25:00,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 18:25:00,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-12 18:25:00,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 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,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-12 18:25:00,015 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2022-07-12 18:25:00,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,015 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-12 18:25:00,015 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,016 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-12 18:25:00,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-12 18:25:00,016 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,016 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:25:00,016 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1889707613, now seen corresponding path program 1 times [2022-07-12 18:25:00,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764539569] [2022-07-12 18:25:00,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:00,160 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:25:00,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:00,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764539569] [2022-07-12 18:25:00,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764539569] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:25:00,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:25:00,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:25:00,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435439673] [2022-07-12 18:25:00,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:25:00,161 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:25:00,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:00,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:25:00,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:25:00,162 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,296 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-12 18:25:00,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:25:00,297 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-12 18:25:00,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,298 INFO L225 Difference]: With dead ends: 57 [2022-07-12 18:25:00,298 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 18:25:00,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:25:00,298 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,298 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:25:00,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 18:25:00,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-12 18:25:00,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 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,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-12 18:25:00,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2022-07-12 18:25:00,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,300 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-12 18:25:00,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:00,300 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-12 18:25:00,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:25:00,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,301 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:25:00,301 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1717205610, now seen corresponding path program 1 times [2022-07-12 18:25:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851541259] [2022-07-12 18:25:00,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:00,347 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:00,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:00,348 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851541259] [2022-07-12 18:25:00,348 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851541259] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:25:00,348 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:25:00,348 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:25:00,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948460251] [2022-07-12 18:25:00,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:25:00,348 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:25:00,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:00,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:25:00,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:25:00,349 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:25:00,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,385 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-12 18:25:00,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:25:00,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:25:00,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,385 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:25:00,385 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:25:00,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:25:00,386 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:25:00,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:25:00,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-07-12 18:25:00,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 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,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-07-12 18:25:00,387 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2022-07-12 18:25:00,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,387 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-07-12 18:25:00,387 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 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:25:00,387 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-07-12 18:25:00,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:25:00,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,388 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:25:00,388 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1566644436, now seen corresponding path program 1 times [2022-07-12 18:25:00,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269413181] [2022-07-12 18:25:00,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:00,462 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:00,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:00,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269413181] [2022-07-12 18:25:00,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269413181] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:25:00,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:25:00,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:25:00,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973714963] [2022-07-12 18:25:00,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:25:00,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:25:00,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:00,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:25:00,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:25:00,464 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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:25:00,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,585 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-07-12 18:25:00,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:25:00,585 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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:25:00,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,586 INFO L225 Difference]: With dead ends: 85 [2022-07-12 18:25:00,586 INFO L226 Difference]: Without dead ends: 85 [2022-07-12 18:25:00,586 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-12 18:25:00,586 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,587 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:25:00,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-12 18:25:00,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2022-07-12 18:25:00,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.208955223880597) internal successors, (81), 70 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:25:00,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-12 18:25:00,588 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 17 [2022-07-12 18:25:00,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,589 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-12 18:25:00,589 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 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:25:00,589 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-12 18:25:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:25:00,589 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,589 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:25:00,590 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 286780758, now seen corresponding path program 1 times [2022-07-12 18:25:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106873804] [2022-07-12 18:25:00,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:00,659 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:00,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:00,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106873804] [2022-07-12 18:25:00,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106873804] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:25:00,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:25:00,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 18:25:00,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153875234] [2022-07-12 18:25:00,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:25:00,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:25:00,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:00,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:25:00,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:25:00,661 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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:25:00,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,772 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-12 18:25:00,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:25:00,772 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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:25:00,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,773 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:25:00,773 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:25:00,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:25:00,774 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:25:00,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:25:00,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2022-07-12 18:25:00,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 72 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:25:00,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-07-12 18:25:00,776 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-07-12 18:25:00,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,776 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-07-12 18:25:00,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 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:25:00,776 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-07-12 18:25:00,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:25:00,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,776 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:25:00,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:25:00,777 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,777 INFO L85 PathProgramCache]: Analyzing trace with hash 2041976217, now seen corresponding path program 1 times [2022-07-12 18:25:00,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208115728] [2022-07-12 18:25:00,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:00,806 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:25:00,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:00,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208115728] [2022-07-12 18:25:00,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208115728] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:25:00,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:25:00,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:25:00,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070234108] [2022-07-12 18:25:00,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:25:00,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:25:00,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:00,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:25:00,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:25:00,808 INFO L87 Difference]: Start difference. First operand 73 states and 85 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:25:00,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:00,817 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-12 18:25:00,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:25:00,818 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:25:00,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:00,818 INFO L225 Difference]: With dead ends: 72 [2022-07-12 18:25:00,818 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 18:25:00,818 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:25:00,819 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:00,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:25:00,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 18:25:00,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-12 18:25:00,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 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,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-12 18:25:00,820 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-07-12 18:25:00,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:00,820 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-12 18:25:00,821 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:25:00,821 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-12 18:25:00,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-12 18:25:00,821 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:00,821 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:00,821 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 18:25:00,821 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:00,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:00,822 INFO L85 PathProgramCache]: Analyzing trace with hash -2012971173, now seen corresponding path program 1 times [2022-07-12 18:25:00,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:00,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570039014] [2022-07-12 18:25:00,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:00,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:01,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:01,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570039014] [2022-07-12 18:25:01,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570039014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:01,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [778066449] [2022-07-12 18:25:01,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:01,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:01,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:01,048 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:25:01,049 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:25:01,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:01,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 18:25:01,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:01,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:01,125 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:01,129 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:01,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:01,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:01,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [778066449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:01,687 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:01,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-12 18:25:01,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531564290] [2022-07-12 18:25:01,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:01,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 18:25:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 18:25:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-12 18:25:01,688 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 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:02,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:02,928 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-12 18:25:02,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-12 18:25:02,928 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 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 20 [2022-07-12 18:25:02,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:02,928 INFO L225 Difference]: With dead ends: 84 [2022-07-12 18:25:02,929 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:25:02,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=432, Invalid=2648, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 18:25:02,930 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:02,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:25:02,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:25:02,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-12 18:25:02,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 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:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-12 18:25:02,932 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2022-07-12 18:25:02,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:02,932 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-12 18:25:02,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 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:02,932 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-12 18:25:02,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-12 18:25:02,932 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:02,932 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:02,950 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:25:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:03,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:03,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -718716967, now seen corresponding path program 1 times [2022-07-12 18:25:03,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:03,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327387821] [2022-07-12 18:25:03,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:03,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:03,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:03,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:03,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:03,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327387821] [2022-07-12 18:25:03,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327387821] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:03,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1485111773] [2022-07-12 18:25:03,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:03,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:03,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:03,233 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:25:03,234 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:25:03,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:03,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 18:25:03,284 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:03,369 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:03,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:03,487 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:25:03,499 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:03,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1485111773] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:03,499 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:03,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-07-12 18:25:03,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754895804] [2022-07-12 18:25:03,500 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:03,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-12 18:25:03,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:03,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-12 18:25:03,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:25:03,501 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:03,696 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-07-12 18:25:03,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:25:03,696 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 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:25:03,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:03,697 INFO L225 Difference]: With dead ends: 56 [2022-07-12 18:25:03,697 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 18:25:03,697 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-07-12 18:25:03,697 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:03,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:25:03,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 18:25:03,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-12 18:25:03,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 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:25:03,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-12 18:25:03,699 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2022-07-12 18:25:03,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:03,699 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-12 18:25:03,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 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:03,699 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-12 18:25:03,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:25:03,699 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:03,699 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:03,716 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:25:03,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:03,900 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:03,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:03,900 INFO L85 PathProgramCache]: Analyzing trace with hash -805389510, now seen corresponding path program 1 times [2022-07-12 18:25:03,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:03,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946475630] [2022-07-12 18:25:03,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:03,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:04,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:04,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946475630] [2022-07-12 18:25:04,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946475630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:04,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637743483] [2022-07-12 18:25:04,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:04,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:04,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:04,055 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:25:04,056 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:25:04,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:04,108 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-12 18:25:04,110 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:04,120 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:04,121 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:04,124 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:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:04,299 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:04,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:25:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:04,544 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637743483] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:04,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:04,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-12 18:25:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184343316] [2022-07-12 18:25:04,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:04,545 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-12 18:25:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:04,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-12 18:25:04,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-07-12 18:25:04,546 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 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,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:04,785 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-12 18:25:04,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-12 18:25:04,785 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 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:25:04,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:04,785 INFO L225 Difference]: With dead ends: 52 [2022-07-12 18:25:04,785 INFO L226 Difference]: Without dead ends: 52 [2022-07-12 18:25:04,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:25:04,786 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:04,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:25:04,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-12 18:25:04,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-12 18:25:04,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 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,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-12 18:25:04,788 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-07-12 18:25:04,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:04,788 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-12 18:25:04,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 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,788 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-12 18:25:04,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-12 18:25:04,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:04,788 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:04,804 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:25:04,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:04,999 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:05,000 INFO L85 PathProgramCache]: Analyzing trace with hash -279519168, now seen corresponding path program 1 times [2022-07-12 18:25:05,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:05,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509362753] [2022-07-12 18:25:05,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:05,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:05,205 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:05,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509362753] [2022-07-12 18:25:05,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509362753] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:05,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [414239180] [2022-07-12 18:25:05,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:05,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:05,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:05,207 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:25:05,216 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:25:05,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:05,273 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 18:25:05,275 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:05,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:05,283 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:05,285 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:05,494 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:05,495 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:05,834 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-12 18:25:05,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [414239180] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:05,834 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:05,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-12 18:25:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87425997] [2022-07-12 18:25:05,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:05,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-12 18:25:05,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:05,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-12 18:25:05,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-07-12 18:25:05,836 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 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:06,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:06,495 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-07-12 18:25:06,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-12 18:25:06,495 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 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 26 [2022-07-12 18:25:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:06,495 INFO L225 Difference]: With dead ends: 51 [2022-07-12 18:25:06,496 INFO L226 Difference]: Without dead ends: 37 [2022-07-12 18:25:06,496 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2022-07-12 18:25:06,496 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:06,497 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:25:06,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-12 18:25:06,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-12 18:25:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 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:25:06,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-12 18:25:06,498 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-12 18:25:06,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:06,498 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-12 18:25:06,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 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:06,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-12 18:25:06,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-12 18:25:06,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:06,499 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:06,517 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:25:06,711 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,SelfDestructingSolverStorable21 [2022-07-12 18:25:06,711 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:06,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:06,712 INFO L85 PathProgramCache]: Analyzing trace with hash -57121321, now seen corresponding path program 2 times [2022-07-12 18:25:06,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:06,713 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672496636] [2022-07-12 18:25:06,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:06,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:06,903 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:06,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672496636] [2022-07-12 18:25:06,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672496636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:06,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884151534] [2022-07-12 18:25:06,904 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:25:06,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:06,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:06,905 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:25:06,906 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:25:06,962 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:25:06,963 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:06,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-12 18:25:06,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:06,969 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:07,007 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:25:07,172 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:25:07,305 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:07,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:25:07,403 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:07,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:07,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:25:07,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)))) is different from false [2022-07-12 18:25:07,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-12 18:25:07,708 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:07,708 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:25:07,715 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:07,715 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:25:07,719 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:25:07,723 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:25:07,832 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:25:07,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884151534] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:07,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:07,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-07-12 18:25:07,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510302617] [2022-07-12 18:25:07,832 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:07,833 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-12 18:25:07,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:07,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-12 18:25:07,834 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1079, Unknown=3, NotChecked=204, Total=1406 [2022-07-12 18:25:07,843 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 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:25:08,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:08,392 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-12 18:25:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:25:08,393 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 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) Word has length 27 [2022-07-12 18:25:08,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:08,393 INFO L225 Difference]: With dead ends: 58 [2022-07-12 18:25:08,393 INFO L226 Difference]: Without dead ends: 45 [2022-07-12 18:25:08,394 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=254, Invalid=2107, Unknown=3, NotChecked=288, Total=2652 [2022-07-12 18:25:08,394 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:08,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 212 Unchecked, 0.1s Time] [2022-07-12 18:25:08,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-12 18:25:08,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-12 18:25:08,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 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:25:08,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-12 18:25:08,395 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 27 [2022-07-12 18:25:08,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:08,396 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-12 18:25:08,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 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:25:08,396 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-12 18:25:08,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-12 18:25:08,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:08,396 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:08,412 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:25:08,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:08,612 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:08,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:08,612 INFO L85 PathProgramCache]: Analyzing trace with hash 614687385, now seen corresponding path program 2 times [2022-07-12 18:25:08,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:08,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647909772] [2022-07-12 18:25:08,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:08,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:08,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:08,820 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:25:08,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647909772] [2022-07-12 18:25:08,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647909772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:08,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223899269] [2022-07-12 18:25:08,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:25:08,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:08,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:08,822 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:25:08,822 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:25:08,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:25:08,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:08,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-12 18:25:08,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:08,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:08,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, 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:08,922 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:09,179 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:25:09,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-12 18:25:09,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223899269] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:09,604 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:09,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-12 18:25:09,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840220817] [2022-07-12 18:25:09,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:09,604 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-12 18:25:09,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:09,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-12 18:25:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-07-12 18:25:09,605 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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:10,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:10,559 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-12 18:25:10,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:25:10,559 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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 32 [2022-07-12 18:25:10,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:10,560 INFO L225 Difference]: With dead ends: 54 [2022-07-12 18:25:10,560 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 18:25:10,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=349, Invalid=2407, Unknown=0, NotChecked=0, Total=2756 [2022-07-12 18:25:10,563 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:10,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:25:10,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 18:25:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-12 18:25:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 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:10,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-12 18:25:10,566 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2022-07-12 18:25:10,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:10,566 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-12 18:25:10,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 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:10,566 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-12 18:25:10,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-12 18:25:10,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:10,567 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:10,589 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:25:10,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:10,783 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:10,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:10,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1981775400, now seen corresponding path program 3 times [2022-07-12 18:25:10,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:10,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233206938] [2022-07-12 18:25:10,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:10,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:10,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233206938] [2022-07-12 18:25:11,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [233206938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:11,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568988145] [2022-07-12 18:25:11,030 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:25:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:11,031 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:25:11,032 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:25:11,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:25:11,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:11,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-12 18:25:11,121 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:11,241 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:25:11,389 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:11,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:25:11,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:25:11,488 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-12 18:25:11,567 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:25:11,568 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:11,569 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 10 [2022-07-12 18:25:11,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:11,571 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:19,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-12 18:25:19,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-12 18:25:21,260 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-12 18:25:21,275 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 372 treesize of output 360 [2022-07-12 18:25:21,569 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:25:21,569 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568988145] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:21,569 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:21,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2022-07-12 18:25:21,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546647402] [2022-07-12 18:25:21,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:21,570 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 18:25:21,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:21,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 18:25:21,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1364, Unknown=10, NotChecked=228, Total=1722 [2022-07-12 18:25:21,570 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:22,294 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (< 2 |c_ULTIMATE.start_main_~length~0#1|) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (<= 3 |c_ULTIMATE.start_main_~length~0#1|) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~length~0#1| 3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-12 18:25:22,801 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cstrncpy_~src#1.base| |c_ULTIMATE.start_cstrncpy_~dst#1.base|)) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| 3) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (= |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 0) (= |c_ULTIMATE.start_cstrncpy_~src#1.offset| 0)) is different from false [2022-07-12 18:25:23,302 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrncpy_~d~0#1.base| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|)))) is different from false [2022-07-12 18:25:23,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:23,503 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-12 18:25:23,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:25:23,503 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-12 18:25:23,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:23,503 INFO L225 Difference]: With dead ends: 78 [2022-07-12 18:25:23,503 INFO L226 Difference]: Without dead ends: 59 [2022-07-12 18:25:23,504 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=217, Invalid=2344, Unknown=13, NotChecked=618, Total=3192 [2022-07-12 18:25:23,505 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:23,505 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 346 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-07-12 18:25:23,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-12 18:25:23,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-12 18:25:23,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 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:23,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-12 18:25:23,506 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-07-12 18:25:23,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:23,506 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-12 18:25:23,507 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:25:23,507 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-12 18:25:23,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-12 18:25:23,507 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:23,507 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:23,523 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:25:23,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:25:23,724 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:23,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:23,724 INFO L85 PathProgramCache]: Analyzing trace with hash 207254747, now seen corresponding path program 4 times [2022-07-12 18:25:23,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:23,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742012678] [2022-07-12 18:25:23,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:23,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:23,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:23,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742012678] [2022-07-12 18:25:23,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1742012678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:23,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1908394227] [2022-07-12 18:25:23,858 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:25:23,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:23,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:23,859 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:25:23,871 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:25:23,953 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:25:23,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:23,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 18:25:23,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:23,978 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:25:23,978 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:24,234 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:24,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:24,547 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:24,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1908394227] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:24,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:24,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-12 18:25:24,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226074223] [2022-07-12 18:25:24,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:24,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 18:25:24,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:24,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 18:25:24,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 18:25:24,550 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 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:25,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:25,110 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-12 18:25:25,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-12 18:25:25,110 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 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:25:25,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:25,110 INFO L225 Difference]: With dead ends: 56 [2022-07-12 18:25:25,110 INFO L226 Difference]: Without dead ends: 56 [2022-07-12 18:25:25,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2022-07-12 18:25:25,111 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:25,111 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 217 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:25:25,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-12 18:25:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-12 18:25:25,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 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:25,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-12 18:25:25,113 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 41 [2022-07-12 18:25:25,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:25,113 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-12 18:25:25,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 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:25,113 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-12 18:25:25,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-12 18:25:25,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:25,113 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:25,129 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:25:25,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:25:25,324 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:25,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:25,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1595560281, now seen corresponding path program 5 times [2022-07-12 18:25:25,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:25,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74228737] [2022-07-12 18:25:25,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:25,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:25,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:25,663 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:25,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:25,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74228737] [2022-07-12 18:25:25,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74228737] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:25,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902293109] [2022-07-12 18:25:25,663 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:25:25,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:25,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:25,669 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:25:25,670 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:25:25,798 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-12 18:25:25,798 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:25,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-12 18:25:25,804 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:25,822 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:25,967 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:25:26,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 17 treesize of output 19 [2022-07-12 18:25:26,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:25:26,182 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:25:26,189 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:25:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:26,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:26,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:25:26,210 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:26,218 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_441) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:26,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:26,242 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_440) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:26,247 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:26,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-12 18:25:26,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_442) |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:25:26,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:26,258 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:25:26,263 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:26,263 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:25:26,265 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:25:26,422 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-12 18:25:26,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902293109] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:26,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:26,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 43 [2022-07-12 18:25:26,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514080844] [2022-07-12 18:25:26,422 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:26,422 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-12 18:25:26,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:26,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-12 18:25:26,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1095, Unknown=8, NotChecked=584, Total=1806 [2022-07-12 18:25:26,423 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 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:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:26,931 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-12 18:25:26,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:25:26,931 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 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 47 [2022-07-12 18:25:26,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:26,932 INFO L225 Difference]: With dead ends: 88 [2022-07-12 18:25:26,932 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:25:26,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1652, Unknown=8, NotChecked=712, Total=2550 [2022-07-12 18:25:26,933 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:26,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 475 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 280 Unchecked, 0.2s Time] [2022-07-12 18:25:26,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:25:26,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-12 18:25:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 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:26,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-12 18:25:26,934 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 47 [2022-07-12 18:25:26,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:26,935 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-12 18:25:26,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 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:26,935 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-12 18:25:26,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-12 18:25:26,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:26,935 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:26,954 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:25:27,151 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,SelfDestructingSolverStorable26 [2022-07-12 18:25:27,152 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:27,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:27,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1297179492, now seen corresponding path program 6 times [2022-07-12 18:25:27,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:27,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134423413] [2022-07-12 18:25:27,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:27,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:27,339 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:27,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134423413] [2022-07-12 18:25:27,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134423413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:27,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [10737986] [2022-07-12 18:25:27,340 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:25:27,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:27,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:27,341 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:25:27,341 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:25:27,442 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-12 18:25:27,442 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:27,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-12 18:25:27,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:27,463 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:25:27,463 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:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:27,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:28,044 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:28,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [10737986] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:28,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:28,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2022-07-12 18:25:28,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865143257] [2022-07-12 18:25:28,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:28,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-12 18:25:28,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:28,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-12 18:25:28,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-07-12 18:25:28,046 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 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:28,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:28,471 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-12 18:25:28,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 18:25:28,472 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 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 51 [2022-07-12 18:25:28,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:28,472 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:25:28,472 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:25:28,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 18:25:28,473 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:28,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 263 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:25:28,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:25:28,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-07-12 18:25:28,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 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:28,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-12 18:25:28,475 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 51 [2022-07-12 18:25:28,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:28,475 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-12 18:25:28,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 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:28,475 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-12 18:25:28,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-12 18:25:28,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:28,476 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:28,492 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:25:28,691 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,SelfDestructingSolverStorable27 [2022-07-12 18:25:28,691 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash -351804326, now seen corresponding path program 7 times [2022-07-12 18:25:28,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:28,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508170056] [2022-07-12 18:25:28,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:28,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:29,147 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:29,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:29,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508170056] [2022-07-12 18:25:29,147 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508170056] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:29,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [790597636] [2022-07-12 18:25:29,147 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:25:29,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:29,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:29,149 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:25:29,150 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:25:29,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:29,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-12 18:25:29,238 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:29,245 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:29,426 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:25:29,577 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:25:29,653 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:25:29,700 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:25:29,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:25:29,721 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:25:29,723 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:29,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:29,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:25:29,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:29,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:29,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:29,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:29,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:29,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_545) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:29,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:29,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:29,792 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:29,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:29,796 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:25:29,800 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:29,800 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:25:29,803 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:25:29,976 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-12 18:25:29,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [790597636] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:29,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:29,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 51 [2022-07-12 18:25:29,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197673182] [2022-07-12 18:25:29,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:29,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:25:29,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:29,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:25:29,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1529, Unknown=10, NotChecked=870, Total=2550 [2022-07-12 18:25:29,977 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 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:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:30,662 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-12 18:25:30,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-12 18:25:30,662 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 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:25:30,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:30,662 INFO L225 Difference]: With dead ends: 98 [2022-07-12 18:25:30,662 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 18:25:30,663 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=213, Invalid=2469, Unknown=10, NotChecked=1090, Total=3782 [2022-07-12 18:25:30,664 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:30,664 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 520 Unchecked, 0.3s Time] [2022-07-12 18:25:30,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 18:25:30,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-12 18:25:30,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 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:30,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-12 18:25:30,675 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2022-07-12 18:25:30,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:30,676 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-12 18:25:30,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 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:30,676 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-12 18:25:30,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 18:25:30,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:30,676 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:30,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:30,876 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,SelfDestructingSolverStorable28 [2022-07-12 18:25:30,877 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:30,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:30,877 INFO L85 PathProgramCache]: Analyzing trace with hash -841664547, now seen corresponding path program 8 times [2022-07-12 18:25:30,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:30,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497341973] [2022-07-12 18:25:30,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:30,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:31,055 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:31,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:31,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497341973] [2022-07-12 18:25:31,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497341973] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:31,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2054604414] [2022-07-12 18:25:31,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:25:31,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:31,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:31,056 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:25:31,057 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:25:31,139 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:25:31,139 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:31,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 18:25:31,142 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:31,386 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:31,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:31,679 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:25:31,711 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:31,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2054604414] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:31,711 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:31,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2022-07-12 18:25:31,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167817030] [2022-07-12 18:25:31,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:31,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-12 18:25:31,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:31,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-12 18:25:31,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-12 18:25:31,713 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 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:32,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:32,411 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-07-12 18:25:32,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:25:32,411 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 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 61 [2022-07-12 18:25:32,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:32,415 INFO L225 Difference]: With dead ends: 72 [2022-07-12 18:25:32,415 INFO L226 Difference]: Without dead ends: 72 [2022-07-12 18:25:32,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=2487, Unknown=0, NotChecked=0, Total=3080 [2022-07-12 18:25:32,416 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 554 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:32,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 330 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:25:32,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-12 18:25:32,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-12 18:25:32,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 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:32,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-12 18:25:32,418 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 61 [2022-07-12 18:25:32,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:32,421 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-12 18:25:32,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 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:32,421 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-12 18:25:32,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:25:32,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:32,421 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:32,440 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:25:32,622 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:32,622 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:32,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:32,622 INFO L85 PathProgramCache]: Analyzing trace with hash -321797194, now seen corresponding path program 3 times [2022-07-12 18:25:32,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:32,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890096416] [2022-07-12 18:25:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:32,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:32,954 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 18:25:32,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890096416] [2022-07-12 18:25:32,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890096416] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:32,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283590520] [2022-07-12 18:25:32,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:25:32,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:32,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:32,955 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:25:32,956 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:25:33,125 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-12 18:25:33,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:33,128 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-12 18:25:33,129 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:33,140 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:25:33,140 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:33,146 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:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 18:25:33,698 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:34,493 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-12 18:25:34,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283590520] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:34,494 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:34,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2022-07-12 18:25:34,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150517062] [2022-07-12 18:25:34,494 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:34,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-12 18:25:34,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:34,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-12 18:25:34,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2022-07-12 18:25:34,496 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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:35,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:35,849 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-12 18:25:35,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:25:35,849 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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 62 [2022-07-12 18:25:35,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:35,850 INFO L225 Difference]: With dead ends: 70 [2022-07-12 18:25:35,850 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 18:25:35,851 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=764, Invalid=5556, Unknown=0, NotChecked=0, Total=6320 [2022-07-12 18:25:35,851 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:35,852 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:25:35,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 18:25:35,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-12 18:25:35,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) 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:25:35,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-12 18:25:35,853 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2022-07-12 18:25:35,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:35,853 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-12 18:25:35,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 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:35,853 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-12 18:25:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 18:25:35,853 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:35,853 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:35,860 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:25:36,054 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:36,054 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:36,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:36,054 INFO L85 PathProgramCache]: Analyzing trace with hash 1711491803, now seen corresponding path program 9 times [2022-07-12 18:25:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:36,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968496788] [2022-07-12 18:25:36,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:36,590 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:36,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968496788] [2022-07-12 18:25:36,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968496788] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:36,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [755488499] [2022-07-12 18:25:36,590 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:25:36,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:36,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:36,591 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:25:36,592 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:25:36,788 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-12 18:25:36,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:36,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 155 conjunts are in the unsatisfiable core [2022-07-12 18:25:36,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:36,801 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:37,099 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:25:37,283 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:25:37,421 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:25:37,555 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:25:37,674 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:25:37,799 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:25:37,902 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:25:37,903 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:37,903 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 10 [2022-07-12 18:25:37,907 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:37,907 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:37,916 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:25:37,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:37,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_726) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:37,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:37,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_725) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:25:37,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:37,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_724) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:37,974 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:37,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_723) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:37,992 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:37,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-12 18:25:37,998 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:38,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:38,001 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:25:38,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:38,008 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:25:38,010 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:25:38,310 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-12 18:25:38,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [755488499] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:38,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:38,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 72 [2022-07-12 18:25:38,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535490457] [2022-07-12 18:25:38,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:38,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 18:25:38,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:38,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 18:25:38,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3357, Unknown=12, NotChecked=1524, Total=5112 [2022-07-12 18:25:38,312 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 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:39,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:39,251 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-07-12 18:25:39,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 18:25:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 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 67 [2022-07-12 18:25:39,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:39,252 INFO L225 Difference]: With dead ends: 112 [2022-07-12 18:25:39,252 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 18:25:39,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=346, Invalid=5542, Unknown=12, NotChecked=1932, Total=7832 [2022-07-12 18:25:39,253 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:39,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 822 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 610 Unchecked, 0.2s Time] [2022-07-12 18:25:39,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 18:25:39,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-12 18:25:39,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) 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:25:39,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-12 18:25:39,256 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2022-07-12 18:25:39,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:39,256 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-12 18:25:39,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 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:39,256 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-12 18:25:39,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-12 18:25:39,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:39,256 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:39,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:39,457 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:39,457 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:39,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:39,457 INFO L85 PathProgramCache]: Analyzing trace with hash 1133270686, now seen corresponding path program 10 times [2022-07-12 18:25:39,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:39,458 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807033217] [2022-07-12 18:25:39,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:39,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:39,699 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:39,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:39,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807033217] [2022-07-12 18:25:39,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807033217] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:39,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579641290] [2022-07-12 18:25:39,700 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:25:39,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:39,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:39,701 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:25:39,702 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:25:39,902 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:25:39,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:39,905 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-12 18:25:39,906 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:40,155 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:40,155 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:40,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 5 treesize of output 3 [2022-07-12 18:25:40,516 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:40,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579641290] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:40,516 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:40,516 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2022-07-12 18:25:40,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018583671] [2022-07-12 18:25:40,516 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:40,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 18:25:40,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:40,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 18:25:40,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 18:25:40,517 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 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:41,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:41,146 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-12 18:25:41,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-12 18:25:41,151 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 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 71 [2022-07-12 18:25:41,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:41,152 INFO L225 Difference]: With dead ends: 80 [2022-07-12 18:25:41,152 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 18:25:41,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=655, Invalid=2767, Unknown=0, NotChecked=0, Total=3422 [2022-07-12 18:25:41,153 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:41,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:25:41,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 18:25:41,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-12 18:25:41,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 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:41,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-07-12 18:25:41,154 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2022-07-12 18:25:41,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:41,155 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-07-12 18:25:41,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 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:41,155 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-07-12 18:25:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-12 18:25:41,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:41,155 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:41,175 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:25:41,371 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,SelfDestructingSolverStorable32 [2022-07-12 18:25:41,372 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:41,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:41,372 INFO L85 PathProgramCache]: Analyzing trace with hash 1392415964, now seen corresponding path program 11 times [2022-07-12 18:25:41,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:41,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317832582] [2022-07-12 18:25:41,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:41,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:42,067 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:42,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:42,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317832582] [2022-07-12 18:25:42,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317832582] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:42,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688731445] [2022-07-12 18:25:42,068 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:25:42,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:42,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:42,069 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:25:42,069 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:25:42,541 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-12 18:25:42,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:42,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-12 18:25:42,547 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:42,560 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:25:42,560 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:42,566 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:42,887 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:25:43,083 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:25:43,221 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:25:43,347 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:25:43,481 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:25:43,612 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:25:43,744 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:25:43,877 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:43,877 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:25:44,012 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 45 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:44,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:45,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:45,277 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:25:45,284 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:45,284 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:25:45,286 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:25:45,887 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 66 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:45,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688731445] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:45,887 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:45,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 86 [2022-07-12 18:25:45,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693420923] [2022-07-12 18:25:45,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:45,888 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-12 18:25:45,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:45,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-12 18:25:45,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=6861, Unknown=6, NotChecked=0, Total=7310 [2022-07-12 18:25:45,889 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 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:48,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:48,103 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-12 18:25:48,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-12 18:25:48,103 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 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:25:48,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:48,104 INFO L225 Difference]: With dead ends: 134 [2022-07-12 18:25:48,104 INFO L226 Difference]: Without dead ends: 91 [2022-07-12 18:25:48,105 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2551 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=1102, Invalid=14894, Unknown=6, NotChecked=0, Total=16002 [2022-07-12 18:25:48,105 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:48,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1039 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 383 Unchecked, 0.2s Time] [2022-07-12 18:25:48,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-12 18:25:48,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-12 18:25:48,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 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:48,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-12 18:25:48,106 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2022-07-12 18:25:48,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:48,106 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-12 18:25:48,107 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 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:48,107 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-12 18:25:48,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-12 18:25:48,107 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:48,107 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:48,124 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-12 18:25:48,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:48,314 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:48,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:48,314 INFO L85 PathProgramCache]: Analyzing trace with hash -2138844579, now seen corresponding path program 12 times [2022-07-12 18:25:48,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:48,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613125444] [2022-07-12 18:25:48,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:48,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:48,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:49,068 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:49,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:49,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613125444] [2022-07-12 18:25:49,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613125444] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:49,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1201624680] [2022-07-12 18:25:49,068 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:25:49,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:49,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:49,069 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:25:49,070 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:25:49,384 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-12 18:25:49,384 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:49,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-12 18:25:49,393 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:49,399 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:49,830 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:25:50,033 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:25:50,171 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:25:50,320 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:25:50,463 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:25:50,606 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:25:50,745 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:25:50,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:25:51,015 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:25:51,017 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:51,017 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 10 [2022-07-12 18:25:51,020 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:51,020 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:51,029 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-12 18:25:51,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:51,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_950) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:25:51,056 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,063 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_949) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,076 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_948) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:51,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_947) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:25:51,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_946) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_945) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,131 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-12 18:25:51,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_951) |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:25:51,142 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:51,142 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:25:51,147 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:51,147 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:25:51,150 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:25:51,615 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-12 18:25:51,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1201624680] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:51,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:51,616 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 31] total 92 [2022-07-12 18:25:51,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663684688] [2022-07-12 18:25:51,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:51,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-07-12 18:25:51,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:51,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-07-12 18:25:51,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5469, Unknown=16, NotChecked=2608, Total=8372 [2022-07-12 18:25:51,623 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 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:53,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:53,294 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-07-12 18:25:53,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-12 18:25:53,295 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 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 87 [2022-07-12 18:25:53,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:53,295 INFO L225 Difference]: With dead ends: 144 [2022-07-12 18:25:53,295 INFO L226 Difference]: Without dead ends: 95 [2022-07-12 18:25:53,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 16 IntricatePredicates, 11 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=487, Invalid=10481, Unknown=16, NotChecked=3536, Total=14520 [2022-07-12 18:25:53,307 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:53,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1499 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-07-12 18:25:53,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-12 18:25:53,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-12 18:25:53,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) 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:25:53,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-12 18:25:53,309 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2022-07-12 18:25:53,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:53,309 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-12 18:25:53,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 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:53,309 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-12 18:25:53,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 18:25:53,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:53,310 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:53,329 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:25:53,510 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:53,511 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:53,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:53,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1788632736, now seen corresponding path program 13 times [2022-07-12 18:25:53,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:53,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134359440] [2022-07-12 18:25:53,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:53,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:53,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:53,842 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:53,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134359440] [2022-07-12 18:25:53,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134359440] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:53,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958716048] [2022-07-12 18:25:53,843 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:25:53,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:53,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:53,844 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:25:53,867 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:25:53,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:53,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-12 18:25:53,976 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:54,334 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:54,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:25:54,771 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:25:54,815 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:54,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958716048] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:25:54,815 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:25:54,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 48 [2022-07-12 18:25:54,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015428895] [2022-07-12 18:25:54,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:25:54,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-12 18:25:54,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:25:54,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-12 18:25:54,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 18:25:54,816 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 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:25:55,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:25:55,974 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-12 18:25:55,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:25:55,974 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 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) Word has length 91 [2022-07-12 18:25:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:25:55,975 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:25:55,975 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:25:55,975 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2022-07-12 18:25:55,976 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 513 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:25:55,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 676 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:25:55,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:25:55,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-12 18:25:55,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 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:55,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-12 18:25:55,978 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 91 [2022-07-12 18:25:55,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:25:55,978 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-12 18:25:55,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 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:25:55,978 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-07-12 18:25:55,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-12 18:25:55,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:25:55,978 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:25:55,995 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:25:56,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:56,196 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:25:56,196 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:25:56,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1984621730, now seen corresponding path program 14 times [2022-07-12 18:25:56,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:25:56,196 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458753722] [2022-07-12 18:25:56,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:25:56,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:25:56,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:25:57,082 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:57,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:25:57,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458753722] [2022-07-12 18:25:57,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458753722] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:25:57,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [600744818] [2022-07-12 18:25:57,083 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:25:57,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:25:57,083 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:25:57,084 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:25:57,085 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:25:57,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:25:57,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:25:57,215 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-12 18:25:57,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:25:57,221 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:57,547 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:25:57,812 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:25:57,985 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:25:58,157 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:25:58,326 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:25:58,504 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:25:58,690 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:25:58,872 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:25:59,062 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:25:59,255 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:25:59,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:25:59,451 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:25:59,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:01,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-12 18:26:01,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)))) is different from false [2022-07-12 18:26:01,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-12 18:26:01,190 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:01,190 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:26:01,197 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:01,197 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:26:01,201 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:26:01,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 11 treesize of output 7 [2022-07-12 18:26:01,878 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-12 18:26:01,878 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [600744818] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:01,878 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:01,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 108 [2022-07-12 18:26:01,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959393030] [2022-07-12 18:26:01,879 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:01,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-12 18:26:01,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:01,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-12 18:26:01,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=10262, Unknown=10, NotChecked=624, Total=11556 [2022-07-12 18:26:01,881 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:26:06,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:06,421 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2022-07-12 18:26:06,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-12 18:26:06,421 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-12 18:26:06,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:06,422 INFO L225 Difference]: With dead ends: 168 [2022-07-12 18:26:06,422 INFO L226 Difference]: Without dead ends: 113 [2022-07-12 18:26:06,423 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4094 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=1415, Invalid=20048, Unknown=11, NotChecked=876, Total=22350 [2022-07-12 18:26:06,423 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 242 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 872 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:06,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1671 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 905 Invalid, 0 Unknown, 872 Unchecked, 0.3s Time] [2022-07-12 18:26:06,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-12 18:26:06,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-12 18:26:06,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) 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:26:06,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-12 18:26:06,425 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2022-07-12 18:26:06,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:06,426 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-12 18:26:06,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:26:06,426 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-12 18:26:06,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-12 18:26:06,426 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:06,426 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:06,446 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:26:06,646 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,SelfDestructingSolverStorable36 [2022-07-12 18:26:06,646 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:06,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:06,647 INFO L85 PathProgramCache]: Analyzing trace with hash -682858529, now seen corresponding path program 15 times [2022-07-12 18:26:06,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:06,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41123446] [2022-07-12 18:26:06,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:06,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:07,696 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:07,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41123446] [2022-07-12 18:26:07,697 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41123446] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:07,697 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662749775] [2022-07-12 18:26:07,697 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:26:07,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:07,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:07,698 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:26:07,699 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:26:09,195 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-12 18:26:09,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:26:09,210 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-12 18:26:09,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:09,219 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:26:09,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, 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:26:10,031 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:26:10,185 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:26:10,335 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:26:10,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:26:10,638 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:26:10,793 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:26:10,959 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:26:11,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:26:11,271 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:26:11,408 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:26:11,410 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:11,410 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 10 [2022-07-12 18:26:11,413 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:11,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:11,422 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-12 18:26:11,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:26:11,434 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1224) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:26:11,439 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1223) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1222) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)))) is different from false [2022-07-12 18:26:11,484 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1221) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:26:11,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,497 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1220) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,517 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1219) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,523 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:26:11,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1218) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:26:11,544 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1217) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:26:11,549 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-12 18:26:11,557 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1225) |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:26:11,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:11,561 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:26:11,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:11,566 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:26:11,568 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:26:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-12 18:26:12,188 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662749775] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:12,188 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:12,188 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 37] total 112 [2022-07-12 18:26:12,188 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [990060603] [2022-07-12 18:26:12,188 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:12,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-12 18:26:12,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:12,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-12 18:26:12,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=8093, Unknown=20, NotChecked=3980, Total=12432 [2022-07-12 18:26:12,190 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 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:26:14,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:14,361 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-12 18:26:14,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 18:26:14,361 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 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 107 [2022-07-12 18:26:14,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:14,362 INFO L225 Difference]: With dead ends: 176 [2022-07-12 18:26:14,362 INFO L226 Difference]: Without dead ends: 115 [2022-07-12 18:26:14,363 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 20 IntricatePredicates, 13 DeprecatedPredicates, 4331 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=574, Invalid=14738, Unknown=20, NotChecked=5260, Total=20592 [2022-07-12 18:26:14,363 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1670 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:14,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1959 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1105 Invalid, 0 Unknown, 1670 Unchecked, 0.4s Time] [2022-07-12 18:26:14,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-12 18:26:14,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-12 18:26:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) 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:26:14,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-12 18:26:14,365 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-07-12 18:26:14,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:14,365 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-12 18:26:14,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 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:26:14,365 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-12 18:26:14,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 18:26:14,366 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:14,366 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:14,387 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:26:14,579 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,SelfDestructingSolverStorable37 [2022-07-12 18:26:14,579 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:14,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:14,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1213254494, now seen corresponding path program 16 times [2022-07-12 18:26:14,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:14,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177169956] [2022-07-12 18:26:14,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:14,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:15,009 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:15,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177169956] [2022-07-12 18:26:15,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177169956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:15,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452441923] [2022-07-12 18:26:15,010 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:26:15,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:15,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:15,011 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:26:15,013 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:26:15,752 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:26:15,752 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:26:15,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-12 18:26:15,760 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:15,770 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:26:15,770 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:26:16,472 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:16,473 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:17,481 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:17,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452441923] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:17,481 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:17,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 72 [2022-07-12 18:26:17,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262482715] [2022-07-12 18:26:17,481 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:17,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-12 18:26:17,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:17,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-12 18:26:17,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4643, Unknown=0, NotChecked=0, Total=5256 [2022-07-12 18:26:17,483 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 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:26:18,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:18,557 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-12 18:26:18,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-12 18:26:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 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 111 [2022-07-12 18:26:18,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:18,562 INFO L225 Difference]: With dead ends: 120 [2022-07-12 18:26:18,562 INFO L226 Difference]: Without dead ends: 120 [2022-07-12 18:26:18,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1756, Invalid=7750, Unknown=0, NotChecked=0, Total=9506 [2022-07-12 18:26:18,563 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 471 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:18,564 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 868 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:26:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-12 18:26:18,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-12 18:26:18,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 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:26:18,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-07-12 18:26:18,566 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2022-07-12 18:26:18,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:18,566 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-07-12 18:26:18,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 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:26:18,567 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-07-12 18:26:18,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 18:26:18,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:18,567 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:18,587 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:26:18,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-12 18:26:18,774 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:18,774 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 547086304, now seen corresponding path program 17 times [2022-07-12 18:26:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:18,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301945995] [2022-07-12 18:26:18,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:18,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:19,962 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:19,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:19,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301945995] [2022-07-12 18:26:19,963 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301945995] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:19,963 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1257112100] [2022-07-12 18:26:19,963 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:26:19,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:19,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:19,964 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:26:19,968 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:26:22,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-12 18:26:22,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:26:22,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-12 18:26:22,936 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:22,956 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:26:22,957 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:26:22,963 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:26:23,589 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:26:23,839 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:26:23,988 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:26:24,145 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:26:24,303 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:26:24,473 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:26:24,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:26:24,807 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:26:24,976 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:26:25,153 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:26:25,340 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:26:25,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:25,523 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:26:25,708 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 153 proven. 389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:25,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:28,173 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:28,173 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:26:28,178 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:28,178 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:26:28,181 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:26:29,392 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 190 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:29,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1257112100] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:29,392 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:29,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 39] total 126 [2022-07-12 18:26:29,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374745003] [2022-07-12 18:26:29,393 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:29,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-12 18:26:29,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:29,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-12 18:26:29,394 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=831, Invalid=14912, Unknown=7, NotChecked=0, Total=15750 [2022-07-12 18:26:29,394 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 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:26:33,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:33,848 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2022-07-12 18:26:33,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-12 18:26:33,849 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 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:26:33,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:33,849 INFO L225 Difference]: With dead ends: 200 [2022-07-12 18:26:33,849 INFO L226 Difference]: Without dead ends: 133 [2022-07-12 18:26:33,850 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6090 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=2066, Invalid=32709, Unknown=7, NotChecked=0, Total=34782 [2022-07-12 18:26:33,851 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 395 mSDsluCounter, 2534 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2583 SdHoareTripleChecker+Invalid, 1981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 768 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:33,851 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2583 Invalid, 1981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 768 Unchecked, 0.4s Time] [2022-07-12 18:26:33,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-12 18:26:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-07-12 18:26:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 0 states have call successors, (0), 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:26:33,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-07-12 18:26:33,853 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 117 [2022-07-12 18:26:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:33,853 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-07-12 18:26:33,853 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 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:26:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-07-12 18:26:33,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-12 18:26:33,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:33,854 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:33,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-12 18:26:34,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:34,062 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:34,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:34,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1821215585, now seen corresponding path program 18 times [2022-07-12 18:26:34,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:34,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [757944647] [2022-07-12 18:26:34,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:34,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:35,442 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:35,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:35,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [757944647] [2022-07-12 18:26:35,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [757944647] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:35,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315070595] [2022-07-12 18:26:35,442 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:26:35,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:35,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:35,443 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:26:35,444 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:26:38,049 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-12 18:26:38,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:26:38,060 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 237 conjunts are in the unsatisfiable core [2022-07-12 18:26:38,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:38,077 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:26:38,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, 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:26:39,057 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:26:39,227 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:26:39,380 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:26:39,526 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:26:39,691 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:26:39,847 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:26:39,998 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:26:40,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:26:40,303 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:26:40,455 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:26:40,624 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:26:40,765 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:26:40,766 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:40,766 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 10 [2022-07-12 18:26:40,769 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:40,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:40,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:26:40,781 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:26:40,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1555) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:26:40,794 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:26:40,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1554) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1553) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:26:40,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1552) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:26:40,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1551) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:26:40,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1550) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1549) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:26:40,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1548) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:26:40,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:26:40,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:26:40,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:26:40,918 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:26:40,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-12 18:26:40,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1556) |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:26:40,927 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:40,927 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:26:40,930 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:40,930 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:26:40,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 11 treesize of output 7 [2022-07-12 18:26:41,779 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-12 18:26:41,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [315070595] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:41,779 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:41,779 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 43, 43] total 132 [2022-07-12 18:26:41,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131006858] [2022-07-12 18:26:41,780 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:41,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-12 18:26:41,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:41,780 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-12 18:26:41,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=11229, Unknown=24, NotChecked=5640, Total=17292 [2022-07-12 18:26:41,781 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 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:26:44,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:44,896 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-07-12 18:26:44,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-12 18:26:44,903 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 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 127 [2022-07-12 18:26:44,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:44,904 INFO L225 Difference]: With dead ends: 208 [2022-07-12 18:26:44,904 INFO L226 Difference]: Without dead ends: 135 [2022-07-12 18:26:44,905 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 24 IntricatePredicates, 13 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=697, Invalid=21725, Unknown=24, NotChecked=7656, Total=30102 [2022-07-12 18:26:44,905 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2969 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:44,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3096 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2369 Invalid, 0 Unknown, 2969 Unchecked, 0.8s Time] [2022-07-12 18:26:44,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-12 18:26:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-12 18:26:44,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 0 states have call successors, (0), 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:26:44,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-07-12 18:26:44,907 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2022-07-12 18:26:44,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:44,907 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-07-12 18:26:44,908 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 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:26:44,908 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-07-12 18:26:44,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-12 18:26:44,908 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:44,908 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:44,917 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:26:45,115 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:45,115 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:45,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:45,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1005234012, now seen corresponding path program 19 times [2022-07-12 18:26:45,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:45,116 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117916861] [2022-07-12 18:26:45,116 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:45,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:45,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:45,600 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:45,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117916861] [2022-07-12 18:26:45,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117916861] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:45,600 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985448114] [2022-07-12 18:26:45,600 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:26:45,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:45,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:45,601 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:26:45,602 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:26:45,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:45,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-12 18:26:45,768 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:46,367 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:46,367 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:47,064 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:26:47,126 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:47,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985448114] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:47,126 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:47,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 64 [2022-07-12 18:26:47,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331115045] [2022-07-12 18:26:47,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:47,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-12 18:26:47,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:47,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-12 18:26:47,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2022-07-12 18:26:47,128 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 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:26:49,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:26:49,000 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-12 18:26:49,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:26:49,000 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 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 131 [2022-07-12 18:26:49,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:26:49,001 INFO L225 Difference]: With dead ends: 140 [2022-07-12 18:26:49,001 INFO L226 Difference]: Without dead ends: 140 [2022-07-12 18:26:49,001 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2126, Invalid=8794, Unknown=0, NotChecked=0, Total=10920 [2022-07-12 18:26:49,002 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 773 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:26:49,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1119 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-12 18:26:49,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-12 18:26:49,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-12 18:26:49,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 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:26:49,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2022-07-12 18:26:49,004 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 131 [2022-07-12 18:26:49,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:26:49,004 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2022-07-12 18:26:49,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 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:26:49,004 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2022-07-12 18:26:49,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-12 18:26:49,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:26:49,005 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:26:49,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-12 18:26:49,223 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,SelfDestructingSolverStorable41 [2022-07-12 18:26:49,223 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:26:49,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:26:49,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1834780062, now seen corresponding path program 20 times [2022-07-12 18:26:49,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:26:49,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527223273] [2022-07-12 18:26:49,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:26:49,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:26:49,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:26:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 50 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:50,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:26:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527223273] [2022-07-12 18:26:50,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527223273] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:26:50,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175171841] [2022-07-12 18:26:50,717 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:26:50,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:26:50,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:26:50,718 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:26:50,718 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:26:50,892 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:26:50,892 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:26:50,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-12 18:26:50,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:26:50,905 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:26:51,553 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:26:51,852 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:26:52,003 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:26:52,168 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:26:52,324 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:26:52,486 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:26:52,648 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:26:52,814 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:26:52,999 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:26:53,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:26:53,351 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:26:53,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:26:53,726 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:26:53,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:53,915 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:26:54,116 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:54,116 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:26:57,396 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:26:57,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:57,400 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:26:57,405 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:26:57,405 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:26:57,407 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:26:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:26:58,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175171841] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:26:58,748 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:26:58,748 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 46, 46] total 148 [2022-07-12 18:26:58,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888116287] [2022-07-12 18:26:58,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:26:58,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-07-12 18:26:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:26:58,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-07-12 18:26:58,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=20517, Unknown=10, NotChecked=0, Total=21756 [2022-07-12 18:26:58,750 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 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:27:03,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:27:03,570 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2022-07-12 18:27:03,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-12 18:27:03,570 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 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:27:03,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:27:03,571 INFO L225 Difference]: With dead ends: 232 [2022-07-12 18:27:03,571 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:27:03,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8559 ImplicationChecksByTransitivity, 12.0s TimeCoverageRelationStatistics Valid=2554, Invalid=39666, Unknown=10, NotChecked=0, Total=42230 [2022-07-12 18:27:03,573 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 600 mSDsluCounter, 2547 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2604 SdHoareTripleChecker+Invalid, 2840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1717 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:27:03,573 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2604 Invalid, 2840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1105 Invalid, 0 Unknown, 1717 Unchecked, 0.4s Time] [2022-07-12 18:27:03,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:27:03,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-12 18:27:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0136054421768708) internal successors, (149), 147 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:27:03,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-12 18:27:03,575 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 137 [2022-07-12 18:27:03,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:27:03,575 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-12 18:27:03,576 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 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:27:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-12 18:27:03,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 18:27:03,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:27:03,576 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:27:03,594 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:27:03,790 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,SelfDestructingSolverStorable42 [2022-07-12 18:27:03,790 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:27:03,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:27:03,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1006091491, now seen corresponding path program 21 times [2022-07-12 18:27:03,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:27:03,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17982741] [2022-07-12 18:27:03,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:27:03,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:27:03,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:27:05,491 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:05,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:27:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17982741] [2022-07-12 18:27:05,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17982741] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:27:05,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1387511095] [2022-07-12 18:27:05,492 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:27:05,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:27:05,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:27:05,493 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:27:05,496 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:27:09,053 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-12 18:27:09,053 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:27:09,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 305 conjunts are in the unsatisfiable core [2022-07-12 18:27:09,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:27:09,077 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:27:10,018 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:27:10,349 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:27:10,524 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:27:10,701 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:27:10,886 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:27:11,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:27:11,252 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:27:11,428 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:27:11,609 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:27:11,802 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:27:11,985 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:27:12,172 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:27:12,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 16 treesize of output 18 [2022-07-12 18:27:12,552 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:27:12,716 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:27:12,717 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:12,718 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 10 [2022-07-12 18:27:12,721 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:12,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:27:12,729 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:27:12,733 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:27:12,740 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1932) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:27:12,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,752 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1931) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1930) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,767 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:27:12,774 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1929) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:27:12,778 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1928) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1927) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,800 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:27:12,807 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1926) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,811 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:27:12,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1925) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:27:12,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1924) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:27:12,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:27:12,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1923) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:27:12,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:27:12,859 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1922) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:27:12,864 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-12 18:27:12,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1921) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-12 18:27:12,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-12 18:27:12,877 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 13)) 0)) is different from false [2022-07-12 18:27:12,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1933) |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:27:12,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:12,902 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:27:12,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:12,906 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:27:12,908 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:27:13,949 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 519 not checked. [2022-07-12 18:27:13,950 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1387511095] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:27:13,950 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:27:13,950 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 49, 49] total 152 [2022-07-12 18:27:13,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [246958764] [2022-07-12 18:27:13,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:27:13,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-07-12 18:27:13,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:27:13,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-07-12 18:27:13,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14877, Unknown=28, NotChecked=7588, Total=22952 [2022-07-12 18:27:13,952 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 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:27:17,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:27:17,809 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2022-07-12 18:27:17,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-12 18:27:17,811 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 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 147 [2022-07-12 18:27:17,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:27:17,812 INFO L225 Difference]: With dead ends: 240 [2022-07-12 18:27:17,812 INFO L226 Difference]: Without dead ends: 155 [2022-07-12 18:27:17,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 190 ConstructedPredicates, 28 IntricatePredicates, 7 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=735, Invalid=26081, Unknown=28, NotChecked=9828, Total=36672 [2022-07-12 18:27:17,813 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3896 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:27:17,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3601 Invalid, 6490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 3896 Unchecked, 0.8s Time] [2022-07-12 18:27:17,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-12 18:27:17,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-07-12 18:27:17,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0132450331125828) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 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:27:17,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-12 18:27:17,816 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2022-07-12 18:27:17,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:27:17,816 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-12 18:27:17,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 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:27:17,816 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-12 18:27:17,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-12 18:27:17,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:27:17,817 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:27:17,825 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:27:18,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:27:18,025 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:27:18,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:27:18,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1386171046, now seen corresponding path program 22 times [2022-07-12 18:27:18,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:27:18,025 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830457179] [2022-07-12 18:27:18,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:27:18,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:27:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:27:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 276 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:27:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830457179] [2022-07-12 18:27:18,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830457179] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:27:18,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210513405] [2022-07-12 18:27:18,642 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:27:18,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:27:18,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:27:18,643 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:27:18,643 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:27:19,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:27:19,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:27:19,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-12 18:27:19,857 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:27:20,566 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:20,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:27:21,271 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 22 treesize of output 18 [2022-07-12 18:27:21,892 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:21,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210513405] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:27:21,892 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:27:21,892 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 86 [2022-07-12 18:27:21,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992080244] [2022-07-12 18:27:21,893 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:27:21,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-12 18:27:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:27:21,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-12 18:27:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=6572, Unknown=0, NotChecked=0, Total=7482 [2022-07-12 18:27:21,894 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 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:27:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:27:23,575 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-12 18:27:23,575 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-12 18:27:23,575 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 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 151 [2022-07-12 18:27:23,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:27:23,576 INFO L225 Difference]: With dead ends: 160 [2022-07-12 18:27:23,576 INFO L226 Difference]: Without dead ends: 160 [2022-07-12 18:27:23,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2988, Invalid=11292, Unknown=0, NotChecked=0, Total=14280 [2022-07-12 18:27:23,577 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 796 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:27:23,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1412 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-12 18:27:23,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-12 18:27:23,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-12 18:27:23,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 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:27:23,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2022-07-12 18:27:23,579 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2022-07-12 18:27:23,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:27:23,579 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2022-07-12 18:27:23,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 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:27:23,580 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2022-07-12 18:27:23,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-12 18:27:23,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:27:23,580 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:27:23,600 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-12 18:27:23,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:27:23,800 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:27:23,800 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:27:23,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679076, now seen corresponding path program 23 times [2022-07-12 18:27:23,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:27:23,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262882363] [2022-07-12 18:27:23,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:27:23,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:27:23,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:27:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 58 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:25,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:27:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262882363] [2022-07-12 18:27:25,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1262882363] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:27:25,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1510984807] [2022-07-12 18:27:25,719 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:27:25,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:27:25,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:27:25,720 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:27:25,725 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:27:44,075 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-07-12 18:27:44,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:27:44,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-12 18:27:44,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:27:44,114 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:27:44,117 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:27:45,132 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:27:45,542 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:27:45,760 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:27:45,998 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:27:46,225 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:27:46,458 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:27:46,709 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:27:46,958 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:27:47,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 17 treesize of output 19 [2022-07-12 18:27:47,470 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:27:47,727 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:27:47,995 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:27:48,273 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:27:48,546 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:27:48,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:27:49,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:49,087 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:27:49,372 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 325 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:27:49,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:27:52,518 WARN L833 $PredicateComparison]: unable to prove that (or (and (<= (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (<= 0 (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12))) (forall ((v_ArrVal_2208 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0))) is different from false [2022-07-12 18:27:53,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)))) is different from false [2022-07-12 18:27:53,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0))) is different from false [2022-07-12 18:27:53,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) is different from false [2022-07-12 18:27:53,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:53,345 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:27:53,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:27:53,350 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:27:53,353 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:27:56,345 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 378 proven. 589 refuted. 0 times theorem prover too weak. 0 trivial. 71 not checked. [2022-07-12 18:27:56,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1510984807] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:27:56,345 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:27:56,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 52, 52] total 168 [2022-07-12 18:27:56,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901341906] [2022-07-12 18:27:56,346 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:27:56,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-07-12 18:27:56,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:27:56,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-07-12 18:27:56,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1289, Invalid=25440, Unknown=19, NotChecked=1308, Total=28056 [2022-07-12 18:27:56,347 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 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:28:06,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:28:06,282 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2022-07-12 18:28:06,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-07-12 18:28:06,282 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 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 157 [2022-07-12 18:28:06,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:28:06,283 INFO L225 Difference]: With dead ends: 264 [2022-07-12 18:28:06,283 INFO L226 Difference]: Without dead ends: 173 [2022-07-12 18:28:06,285 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 496 GetRequests, 240 SyntacticMatches, 9 SemanticMatches, 247 ConstructedPredicates, 4 IntricatePredicates, 2 DeprecatedPredicates, 10943 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=3142, Invalid=56635, Unknown=19, NotChecked=1956, Total=61752 [2022-07-12 18:28:06,285 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 629 mSDsluCounter, 4149 mSDsCounter, 0 mSdLazyCounter, 2111 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 4214 SdHoareTripleChecker+Invalid, 4884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2754 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:28:06,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 4214 Invalid, 4884 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2111 Invalid, 0 Unknown, 2754 Unchecked, 0.7s Time] [2022-07-12 18:28:06,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-12 18:28:06,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-07-12 18:28:06,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 0 states have call successors, (0), 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:28:06,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2022-07-12 18:28:06,287 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 157 [2022-07-12 18:28:06,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:28:06,288 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2022-07-12 18:28:06,288 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 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:28:06,288 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2022-07-12 18:28:06,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-12 18:28:06,289 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:28:06,289 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:28:06,301 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:28:06,495 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:28:06,495 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:28:06,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:28:06,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1522236517, now seen corresponding path program 24 times [2022-07-12 18:28:06,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:28:06,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083246959] [2022-07-12 18:28:06,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:28:06,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:28:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:28:08,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:08,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:28:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083246959] [2022-07-12 18:28:08,601 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083246959] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:28:08,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [387729913] [2022-07-12 18:28:08,601 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:28:08,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:28:08,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:28:08,602 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:28:08,603 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:28:32,611 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-12 18:28:32,611 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:28:32,655 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 347 conjunts are in the unsatisfiable core [2022-07-12 18:28:32,659 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:28:32,673 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:28:33,840 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:28:34,144 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:28:34,329 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:28:34,517 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:28:34,719 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:28:34,923 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:28:35,109 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:28:35,304 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:28:35,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:28:35,703 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:28:35,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 16 treesize of output 18 [2022-07-12 18:28:36,116 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:28:36,317 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:28:36,519 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:28:36,729 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:28:36,943 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:28:37,130 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:28:37,131 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:28:37,131 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 10 [2022-07-12 18:28:37,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:37,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:28:37,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-12 18:28:37,160 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:28:37,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2363) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:28:37,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,179 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2362) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,191 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2361) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,196 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:28:37,203 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2360) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:28:37,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,214 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2359) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,227 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2358) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,232 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,239 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2357) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:28:37,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2356) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-12 18:28:37,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2355) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:28:37,279 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2354) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:28:37,284 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:28:37,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2353) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:28:37,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-12 18:28:37,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2352) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-12 18:28:37,322 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-12 18:28:37,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2351) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-12 18:28:37,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,343 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2350) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 15)) 0)) is different from false [2022-07-12 18:28:37,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-12 18:28:37,355 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2364) |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:28:37,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:28:37,360 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:28:37,364 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:28:37,364 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:28:37,366 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:28:38,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 689 not checked. [2022-07-12 18:28:38,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [387729913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:28:38,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:28:38,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 55, 55] total 172 [2022-07-12 18:28:38,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377187236] [2022-07-12 18:28:38,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:28:38,649 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2022-07-12 18:28:38,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:28:38,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2022-07-12 18:28:38,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=19037, Unknown=32, NotChecked=9824, Total=29412 [2022-07-12 18:28:38,651 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 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:28:43,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:28:43,323 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2022-07-12 18:28:43,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2022-07-12 18:28:43,323 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 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 167 [2022-07-12 18:28:43,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:28:43,324 INFO L225 Difference]: With dead ends: 272 [2022-07-12 18:28:43,324 INFO L226 Difference]: Without dead ends: 175 [2022-07-12 18:28:43,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 470 GetRequests, 242 SyntacticMatches, 20 SemanticMatches, 208 ConstructedPredicates, 32 IntricatePredicates, 1 DeprecatedPredicates, 10150 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=776, Invalid=30826, Unknown=32, NotChecked=12256, Total=43890 [2022-07-12 18:28:43,326 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 77 mSDsluCounter, 4987 mSDsCounter, 0 mSdLazyCounter, 3464 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 5053 SdHoareTripleChecker+Invalid, 9067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 3464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5577 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:28:43,326 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 5053 Invalid, 9067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 3464 Invalid, 0 Unknown, 5577 Unchecked, 1.1s Time] [2022-07-12 18:28:43,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-12 18:28:43,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-12 18:28:43,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0116959064327486) internal successors, (173), 171 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:28:43,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2022-07-12 18:28:43,328 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2022-07-12 18:28:43,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:28:43,328 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2022-07-12 18:28:43,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 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:28:43,328 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2022-07-12 18:28:43,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-12 18:28:43,329 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:28:43,329 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:28:43,345 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:28:43,543 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,SelfDestructingSolverStorable46 [2022-07-12 18:28:43,543 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:28:43,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:28:43,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1872595624, now seen corresponding path program 25 times [2022-07-12 18:28:43,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:28:43,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991878425] [2022-07-12 18:28:43,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:28:43,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:28:43,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:28:44,281 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 378 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:44,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:28:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991878425] [2022-07-12 18:28:44,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991878425] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:28:44,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344324273] [2022-07-12 18:28:44,281 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:28:44,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:28:44,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:28:44,282 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:28:44,283 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:28:44,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:28:44,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-12 18:28:44,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:28:45,246 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:45,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:28:46,158 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:28:46,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:46,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344324273] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:28:46,235 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:28:46,235 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 81 [2022-07-12 18:28:46,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549694583] [2022-07-12 18:28:46,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:28:46,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-12 18:28:46,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:28:46,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-12 18:28:46,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=5932, Unknown=0, NotChecked=0, Total=6642 [2022-07-12 18:28:46,237 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 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:28:48,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:28:48,609 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2022-07-12 18:28:48,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-12 18:28:48,610 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 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 171 [2022-07-12 18:28:48,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:28:48,610 INFO L225 Difference]: With dead ends: 180 [2022-07-12 18:28:48,610 INFO L226 Difference]: Without dead ends: 180 [2022-07-12 18:28:48,611 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2675, Invalid=11367, Unknown=0, NotChecked=0, Total=14042 [2022-07-12 18:28:48,612 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 884 mSDsluCounter, 1970 mSDsCounter, 0 mSdLazyCounter, 3531 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 2040 SdHoareTripleChecker+Invalid, 3708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 3531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:28:48,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 2040 Invalid, 3708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 3531 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2022-07-12 18:28:48,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-12 18:28:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-07-12 18:28:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.0112994350282485) internal successors, (179), 177 states have internal predecessors, (179), 0 states have call successors, (0), 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:28:48,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2022-07-12 18:28:48,614 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 171 [2022-07-12 18:28:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:28:48,614 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2022-07-12 18:28:48,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 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:28:48,615 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2022-07-12 18:28:48,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-12 18:28:48,615 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:28:48,615 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:28:48,634 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-12 18:28:48,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-12 18:28:48,831 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:28:48,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:28:48,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1129781606, now seen corresponding path program 26 times [2022-07-12 18:28:48,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:28:48,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726697986] [2022-07-12 18:28:48,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:28:48,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:28:48,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:28:51,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 66 proven. 1280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:51,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:28:51,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726697986] [2022-07-12 18:28:51,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726697986] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:28:51,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1900195983] [2022-07-12 18:28:51,229 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:28:51,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:28:51,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:28:51,230 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:28:51,231 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:28:51,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:28:51,488 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:28:51,494 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 269 conjunts are in the unsatisfiable core [2022-07-12 18:28:51,498 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:28:51,500 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:28:52,407 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:28:52,811 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:28:53,020 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:28:53,232 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:28:53,470 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:28:53,708 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:28:53,943 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:28:54,195 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:28:54,449 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:28:54,689 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:28:54,937 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:28:55,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 17 treesize of output 19 [2022-07-12 18:28:55,467 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:28:55,745 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:28:56,031 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:28:56,301 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:28:56,562 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:28:56,824 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:28:56,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-12 18:28:57,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 435 proven. 911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:28:57,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:29:01,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) (<= (+ 18 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2672) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-12 18:29:01,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2672) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) (<= (+ 18 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|))) is different from false [2022-07-12 18:29:01,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2672 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) (<= (+ 18 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2672) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_549|))) is different from false [2022-07-12 18:29:01,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:29:01,961 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:29:01,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:29:01,969 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:29:01,973 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:29:01,976 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:29:03,979 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 435 proven. 894 refuted. 0 times theorem prover too weak. 0 trivial. 17 not checked. [2022-07-12 18:29:03,980 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1900195983] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:29:03,980 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:29:03,980 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [74, 58, 58] total 188 [2022-07-12 18:29:03,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386850658] [2022-07-12 18:29:03,980 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:29:03,980 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 188 states [2022-07-12 18:29:03,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:29:03,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 188 interpolants. [2022-07-12 18:29:03,982 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1816, Invalid=32214, Unknown=22, NotChecked=1104, Total=35156 [2022-07-12 18:29:03,982 INFO L87 Difference]: Start difference. First operand 178 states and 179 transitions. Second operand has 188 states, 188 states have (on average 2.7819148936170213) internal successors, (523), 188 states have internal predecessors, (523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)