./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 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/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 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:19:05,910 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:19:05,912 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:19:05,943 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:19:05,944 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:19:05,945 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:19:05,946 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:19:05,950 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:19:05,952 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:19:05,957 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:19:05,958 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:19:05,959 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:19:05,960 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:19:05,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:19:05,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:19:05,967 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:19:05,967 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:19:05,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:19:05,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:19:05,972 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:19:05,975 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:19:05,976 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:19:05,977 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:19:05,977 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:19:05,979 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:19:05,982 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:19:05,982 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:19:05,983 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:19:05,984 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:19:05,984 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:19:05,985 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:19:05,985 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:19:05,987 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:19:05,987 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:19:05,988 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:19:05,988 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:19:05,989 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:19:05,989 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:19:05,989 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:19:05,989 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:19:05,990 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:19:05,992 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:19:05,993 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:19:06,027 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:19:06,028 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:19:06,028 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:19:06,029 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:19:06,029 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:19:06,029 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:19:06,030 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:19:06,030 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:19:06,030 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:19:06,031 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:19:06,031 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:19:06,031 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:19:06,031 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:19:06,032 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:19:06,034 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:19:06,034 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:19:06,034 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:19:06,034 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:19:06,034 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:19:06,034 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:19:06,035 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:19:06,035 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:19:06,035 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:19:06,035 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:19:06,035 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 -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-07-20 05:19:06,248 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:19:06,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:19:06,269 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:19:06,269 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:19:06,270 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:19:06,272 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-20 05:19:06,335 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b1b4f17/10d3524f5e514aad902c41f0b6bb4d03/FLAGa5c76a10a [2022-07-20 05:19:06,761 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:19:06,762 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-20 05:19:06,778 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b1b4f17/10d3524f5e514aad902c41f0b6bb4d03/FLAGa5c76a10a [2022-07-20 05:19:06,801 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e4b1b4f17/10d3524f5e514aad902c41f0b6bb4d03 [2022-07-20 05:19:06,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:19:06,814 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:19:06,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:19:06,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:19:06,821 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:19:06,821 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:19:06" (1/1) ... [2022-07-20 05:19:06,822 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d927a56 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:06, skipping insertion in model container [2022-07-20 05:19:06,822 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:19:06" (1/1) ... [2022-07-20 05:19:06,826 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:19:06,872 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:19:07,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:19:07,062 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:19:07,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:19:07,106 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:19:07,109 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07 WrapperNode [2022-07-20 05:19:07,109 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:19:07,110 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:19:07,110 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:19:07,112 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:19:07,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,133 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,147 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-20 05:19:07,148 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:19:07,148 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:19:07,150 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:19:07,150 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:19:07,156 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,156 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,170 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,171 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:19:07,173 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:19:07,173 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:19:07,174 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:19:07,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (1/1) ... [2022-07-20 05:19:07,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:19:07,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:07,211 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-20 05:19:07,219 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-20 05:19:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:19:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:19:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:19:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:19:07,239 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:19:07,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:19:07,346 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:19:07,347 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:19:07,504 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:19:07,508 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:19:07,508 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-20 05:19:07,509 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:19:07 BoogieIcfgContainer [2022-07-20 05:19:07,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:19:07,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:19:07,511 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:19:07,525 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:19:07,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:19:06" (1/3) ... [2022-07-20 05:19:07,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461fb641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:19:07, skipping insertion in model container [2022-07-20 05:19:07,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:19:07" (2/3) ... [2022-07-20 05:19:07,527 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@461fb641 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:19:07, skipping insertion in model container [2022-07-20 05:19:07,527 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:19:07" (3/3) ... [2022-07-20 05:19:07,528 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-07-20 05:19:07,538 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:19:07,538 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-20 05:19:07,577 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:19:07,582 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@69fa5b86, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@443f2c13 [2022-07-20 05:19:07,583 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-20 05:19:07,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 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-20 05:19:07,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:19:07,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:07,601 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:07,601 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-20 05:19:07,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-20 05:19:07,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:07,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809890637] [2022-07-20 05:19:07,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:07,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:07,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:07,738 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-20 05:19:07,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:07,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809890637] [2022-07-20 05:19:07,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809890637] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:07,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:07,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:19:07,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232493739] [2022-07-20 05:19:07,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:07,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:19:07,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:07,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:19:07,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:19:07,766 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 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) 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-20 05:19:07,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:07,809 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-20 05:19:07,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:19:07,811 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-20 05:19:07,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:07,816 INFO L225 Difference]: With dead ends: 33 [2022-07-20 05:19:07,816 INFO L226 Difference]: Without dead ends: 31 [2022-07-20 05:19:07,817 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-20 05:19:07,820 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 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-20 05:19:07,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:07,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-20 05:19:07,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-20 05:19:07,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:07,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-20 05:19:07,845 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2022-07-20 05:19:07,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:07,845 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-20 05:19:07,845 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-20 05:19:07,846 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-20 05:19:07,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:19:07,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:07,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:07,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:19:07,847 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-20 05:19:07,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-20 05:19:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:07,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426412429] [2022-07-20 05:19:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:07,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:07,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:07,930 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-20 05:19:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:07,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426412429] [2022-07-20 05:19:07,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426412429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:07,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:07,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:19:07,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968895730] [2022-07-20 05:19:07,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:07,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:19:07,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:07,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:19:07,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:19:07,934 INFO L87 Difference]: Start difference. First operand 31 states and 36 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-20 05:19:07,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:07,969 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-20 05:19:07,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:19:07,969 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-20 05:19:07,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:07,971 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:19:07,972 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:19:07,974 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-20 05:19:07,976 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 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-20 05:19:07,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:07,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:19:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 05:19:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-20 05:19:07,981 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2022-07-20 05:19:07,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:07,982 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-20 05:19:07,982 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-20 05:19:07,982 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-20 05:19:07,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:19:07,983 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:07,983 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:07,983 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:19:07,984 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-20 05:19:07,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:07,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-20 05:19:07,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:07,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719777679] [2022-07-20 05:19:07,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:07,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:08,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,036 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719777679] [2022-07-20 05:19:08,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719777679] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:19:08,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799504728] [2022-07-20 05:19:08,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:19:08,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:19:08,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:19:08,038 INFO L87 Difference]: Start difference. First operand 30 states and 35 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-20 05:19:08,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,050 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-20 05:19:08,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:19:08,050 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-20 05:19:08,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,051 INFO L225 Difference]: With dead ends: 53 [2022-07-20 05:19:08,051 INFO L226 Difference]: Without dead ends: 53 [2022-07-20 05:19:08,051 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-20 05:19:08,052 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 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-20 05:19:08,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-20 05:19:08,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-20 05:19:08,055 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-20 05:19:08,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-20 05:19:08,055 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-20 05:19:08,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,056 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-20 05:19:08,061 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-20 05:19:08,061 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-20 05:19:08,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:19:08,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,062 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:19:08,062 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-20 05:19:08,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,063 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-20 05:19:08,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404145933] [2022-07-20 05:19:08,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,130 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-20 05:19:08,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404145933] [2022-07-20 05:19:08,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404145933] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:19:08,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866908568] [2022-07-20 05:19:08,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,132 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:19:08,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:19:08,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:19:08,133 INFO L87 Difference]: Start difference. First operand 33 states and 39 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-20 05:19:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,173 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-20 05:19:08,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:19:08,174 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-20 05:19:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,174 INFO L225 Difference]: With dead ends: 57 [2022-07-20 05:19:08,174 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 05:19:08,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:19:08,175 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:08,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 05:19:08,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-20 05:19:08,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 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-20 05:19:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-20 05:19:08,178 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2022-07-20 05:19:08,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,179 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-20 05:19:08,179 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-20 05:19:08,179 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-20 05:19:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:19:08,180 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,180 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:19:08,180 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:08,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,180 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2022-07-20 05:19:08,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,181 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932269047] [2022-07-20 05:19:08,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,239 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-20 05:19:08,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932269047] [2022-07-20 05:19:08,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932269047] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 05:19:08,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749201331] [2022-07-20 05:19:08,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:19:08,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:19:08,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:19:08,242 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,305 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-20 05:19:08,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:19:08,311 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:19:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,313 INFO L225 Difference]: With dead ends: 46 [2022-07-20 05:19:08,313 INFO L226 Difference]: Without dead ends: 46 [2022-07-20 05:19:08,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:19:08,318 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:08,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-20 05:19:08,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-20 05:19:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 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-20 05:19:08,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-07-20 05:19:08,325 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2022-07-20 05:19:08,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,325 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-20 05:19:08,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,326 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-07-20 05:19:08,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:19:08,326 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,326 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:19:08,326 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:08,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,327 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2022-07-20 05:19:08,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [845851758] [2022-07-20 05:19:08,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,367 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-20 05:19:08,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [845851758] [2022-07-20 05:19:08,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [845851758] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:19:08,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20096568] [2022-07-20 05:19:08,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:19:08,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:19:08,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:19:08,370 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,408 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-20 05:19:08,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:19:08,408 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:19:08,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,410 INFO L225 Difference]: With dead ends: 36 [2022-07-20 05:19:08,410 INFO L226 Difference]: Without dead ends: 36 [2022-07-20 05:19:08,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:19:08,413 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:08,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-20 05:19:08,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-20 05:19:08,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-20 05:19:08,421 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2022-07-20 05:19:08,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,422 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-20 05:19:08,422 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,422 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-20 05:19:08,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:19:08,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,422 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:19:08,423 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:08,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2022-07-20 05:19:08,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,423 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035441717] [2022-07-20 05:19:08,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,509 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-20 05:19:08,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035441717] [2022-07-20 05:19:08,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035441717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:19:08,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191948239] [2022-07-20 05:19:08,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:19:08,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:19:08,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:19:08,511 INFO L87 Difference]: Start difference. First operand 36 states and 44 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-20 05:19:08,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,545 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-20 05:19:08,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:19:08,545 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-20 05:19:08,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,546 INFO L225 Difference]: With dead ends: 35 [2022-07-20 05:19:08,547 INFO L226 Difference]: Without dead ends: 35 [2022-07-20 05:19:08,547 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:19:08,549 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:08,550 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-20 05:19:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-20 05:19:08,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 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-20 05:19:08,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-20 05:19:08,558 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-07-20 05:19:08,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,559 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-20 05:19:08,559 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-20 05:19:08,559 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-20 05:19:08,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:19:08,560 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,560 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,560 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:19:08,560 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:08,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2022-07-20 05:19:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376622322] [2022-07-20 05:19:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,617 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-20 05:19:08,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,617 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376622322] [2022-07-20 05:19:08,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376622322] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:08,618 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:08,618 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:19:08,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134604485] [2022-07-20 05:19:08,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:08,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:19:08,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:08,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:19:08,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:19:08,619 INFO L87 Difference]: Start difference. First operand 35 states and 43 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-20 05:19:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:08,667 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-20 05:19:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:19:08,667 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-20 05:19:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:08,667 INFO L225 Difference]: With dead ends: 41 [2022-07-20 05:19:08,668 INFO L226 Difference]: Without dead ends: 41 [2022-07-20 05:19:08,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:19:08,668 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:08,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:08,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-20 05:19:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-07-20 05:19:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:08,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-20 05:19:08,671 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2022-07-20 05:19:08,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:08,671 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-20 05:19:08,671 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-20 05:19:08,671 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-20 05:19:08,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:19:08,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:08,672 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:08,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:19:08,672 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:08,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:08,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-20 05:19:08,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:08,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340225154] [2022-07-20 05:19:08,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,716 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-20 05:19:08,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:08,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340225154] [2022-07-20 05:19:08,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340225154] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:08,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [226320205] [2022-07-20 05:19:08,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:08,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:08,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:08,719 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-20 05:19:08,720 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-20 05:19:08,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:08,768 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:19:08,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:08,852 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:19:08,853 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-20 05:19:08,918 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-20 05:19:08,919 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:09,029 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-20 05:19:09,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [226320205] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:09,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:09,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-20 05:19:09,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528595114] [2022-07-20 05:19:09,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:19:09,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:19:09,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:19:09,032 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,133 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-07-20 05:19:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:19:09,134 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:19:09,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,134 INFO L225 Difference]: With dead ends: 80 [2022-07-20 05:19:09,134 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 05:19:09,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:19:09,135 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,135 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:19:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 05:19:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2022-07-20 05:19:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 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-20 05:19:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-20 05:19:09,137 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2022-07-20 05:19:09,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,137 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-20 05:19:09,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-20 05:19:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 05:19:09,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,138 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,155 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 05:19:09,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:09,355 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,356 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2022-07-20 05:19:09,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377213736] [2022-07-20 05:19:09,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,391 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-20 05:19:09,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377213736] [2022-07-20 05:19:09,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377213736] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:19:09,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853557374] [2022-07-20 05:19:09,393 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,393 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:19:09,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:19:09,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:19:09,393 INFO L87 Difference]: Start difference. First operand 33 states and 40 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-20 05:19:09,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,403 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-20 05:19:09,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:19:09,404 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-20 05:19:09,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,404 INFO L225 Difference]: With dead ends: 33 [2022-07-20 05:19:09,404 INFO L226 Difference]: Without dead ends: 33 [2022-07-20 05:19:09,404 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-20 05:19:09,405 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,405 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:09,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-20 05:19:09,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-20 05:19:09,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) 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-20 05:19:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-20 05:19:09,407 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2022-07-20 05:19:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,407 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-20 05:19:09,407 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-20 05:19:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-20 05:19:09,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:19:09,408 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,408 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:19:09,408 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2022-07-20 05:19:09,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272869688] [2022-07-20 05:19:09,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,432 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-20 05:19:09,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272869688] [2022-07-20 05:19:09,432 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272869688] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,432 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,432 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:19:09,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221256499] [2022-07-20 05:19:09,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:19:09,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:19:09,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:19:09,433 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,456 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-07-20 05:19:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 05:19:09,456 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:19:09,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,457 INFO L225 Difference]: With dead ends: 61 [2022-07-20 05:19:09,457 INFO L226 Difference]: Without dead ends: 61 [2022-07-20 05:19:09,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:19:09,458 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:09,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-20 05:19:09,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-20 05:19:09,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 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-20 05:19:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-20 05:19:09,460 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2022-07-20 05:19:09,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,460 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-20 05:19:09,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,461 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-20 05:19:09,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:19:09,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,461 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:19:09,461 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2022-07-20 05:19:09,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087017020] [2022-07-20 05:19:09,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,517 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-20 05:19:09,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087017020] [2022-07-20 05:19:09,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087017020] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,518 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,518 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:19:09,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739280076] [2022-07-20 05:19:09,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:19:09,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:19:09,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:19:09,519 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,583 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-07-20 05:19:09,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:19:09,583 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:19:09,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,584 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:19:09,584 INFO L226 Difference]: Without dead ends: 69 [2022-07-20 05:19:09,584 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:19:09,584 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,585 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:09,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-20 05:19:09,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-20 05:19:09,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) 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-20 05:19:09,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-20 05:19:09,587 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2022-07-20 05:19:09,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,587 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-20 05:19:09,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,587 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-20 05:19:09,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:19:09,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,588 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 05:19:09,588 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2022-07-20 05:19:09,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781027006] [2022-07-20 05:19:09,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,660 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-20 05:19:09,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781027006] [2022-07-20 05:19:09,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781027006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,660 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,660 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 05:19:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [480291505] [2022-07-20 05:19:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,661 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 05:19:09,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 05:19:09,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:19:09,662 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,839 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-20 05:19:09,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:19:09,840 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:19:09,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,841 INFO L225 Difference]: With dead ends: 81 [2022-07-20 05:19:09,841 INFO L226 Difference]: Without dead ends: 81 [2022-07-20 05:19:09,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-20 05:19:09,842 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-20 05:19:09,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-20 05:19:09,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-20 05:19:09,844 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2022-07-20 05:19:09,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,844 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-20 05:19:09,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,845 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-20 05:19:09,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:19:09,845 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,845 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:19:09,845 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2022-07-20 05:19:09,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504023946] [2022-07-20 05:19:09,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,871 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-20 05:19:09,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504023946] [2022-07-20 05:19:09,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504023946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:19:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229316812] [2022-07-20 05:19:09,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:19:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:19:09,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:19:09,872 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:09,909 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-07-20 05:19:09,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:19:09,909 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:19:09,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:09,910 INFO L225 Difference]: With dead ends: 54 [2022-07-20 05:19:09,910 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:19:09,910 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:19:09,910 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:09,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:19:09,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-20 05:19:09,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 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-20 05:19:09,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-20 05:19:09,912 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2022-07-20 05:19:09,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:09,912 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-20 05:19:09,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:09,912 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-20 05:19:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:19:09,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:09,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:09,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:19:09,913 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:09,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:09,913 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2022-07-20 05:19:09,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:09,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650850077] [2022-07-20 05:19:09,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:09,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:09,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:09,965 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-20 05:19:09,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:09,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650850077] [2022-07-20 05:19:09,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650850077] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:09,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:09,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:19:09,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460700829] [2022-07-20 05:19:09,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:09,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:19:09,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:09,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:19:09,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:19:09,967 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:10,023 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-20 05:19:10,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:19:10,024 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:19:10,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:10,024 INFO L225 Difference]: With dead ends: 66 [2022-07-20 05:19:10,024 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 05:19:10,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:19:10,025 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:10,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:10,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 05:19:10,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-07-20 05:19:10,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-20 05:19:10,027 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-07-20 05:19:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:10,027 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-20 05:19:10,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-20 05:19:10,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 05:19:10,027 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:10,028 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:10,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:19:10,028 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:10,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:10,028 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2022-07-20 05:19:10,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:10,028 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079688332] [2022-07-20 05:19:10,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:10,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:10,142 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-20 05:19:10,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:10,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079688332] [2022-07-20 05:19:10,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079688332] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:10,143 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:10,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 05:19:10,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689560251] [2022-07-20 05:19:10,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:10,143 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 05:19:10,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:10,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 05:19:10,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-20 05:19:10,144 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:10,293 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-20 05:19:10,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 05:19:10,293 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 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 15 [2022-07-20 05:19:10,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:10,294 INFO L225 Difference]: With dead ends: 67 [2022-07-20 05:19:10,294 INFO L226 Difference]: Without dead ends: 67 [2022-07-20 05:19:10,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:19:10,294 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:10,295 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:19:10,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-20 05:19:10,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-20 05:19:10,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-20 05:19:10,296 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2022-07-20 05:19:10,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:10,297 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-20 05:19:10,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,297 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-20 05:19:10,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:19:10,297 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:10,297 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:10,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:19:10,298 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:10,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:10,298 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2022-07-20 05:19:10,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:10,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111818479] [2022-07-20 05:19:10,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:10,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:10,328 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-20 05:19:10,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:10,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111818479] [2022-07-20 05:19:10,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111818479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:19:10,328 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:19:10,328 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:19:10,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986975587] [2022-07-20 05:19:10,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:19:10,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:19:10,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:10,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:19:10,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:19:10,329 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 05:19:10,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:10,339 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-20 05:19:10,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:19:10,339 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 05:19:10,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:10,339 INFO L225 Difference]: With dead ends: 64 [2022-07-20 05:19:10,340 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:19:10,340 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-20 05:19:10,340 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 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-20 05:19:10,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:10,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:19:10,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-20 05:19:10,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 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-20 05:19:10,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-20 05:19:10,342 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-07-20 05:19:10,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:10,342 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-20 05:19:10,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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-20 05:19:10,342 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-20 05:19:10,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:19:10,342 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:10,342 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:10,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 05:19:10,343 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:10,343 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:10,343 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2022-07-20 05:19:10,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:10,343 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754421687] [2022-07-20 05:19:10,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:10,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:10,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:10,417 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-20 05:19:10,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754421687] [2022-07-20 05:19:10,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754421687] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:10,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822119028] [2022-07-20 05:19:10,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:10,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:10,418 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:10,419 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-20 05:19:10,432 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-20 05:19:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:10,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:19:10,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:10,567 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-20 05:19:10,568 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:10,691 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-20 05:19:10,718 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-20 05:19:10,718 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822119028] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:10,718 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:10,718 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-20 05:19:10,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [382880147] [2022-07-20 05:19:10,719 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:10,719 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-20 05:19:10,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:10,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-20 05:19:10,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-20 05:19:10,719 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:10,949 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-20 05:19:10,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:19:10,949 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-20 05:19:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:10,950 INFO L225 Difference]: With dead ends: 63 [2022-07-20 05:19:10,950 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:19:10,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-20 05:19:10,951 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:10,951 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:19:10,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:19:10,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-20 05:19:10,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 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-20 05:19:10,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-20 05:19:10,952 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2022-07-20 05:19:10,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:10,953 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-20 05:19:10,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:10,953 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-20 05:19:10,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:19:10,953 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:10,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:10,972 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-20 05:19:11,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 05:19:11,175 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-20 05:19:11,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:11,175 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2022-07-20 05:19:11,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:11,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557340006] [2022-07-20 05:19:11,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:11,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:11,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:11,415 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-20 05:19:11,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557340006] [2022-07-20 05:19:11,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557340006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:11,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [540218197] [2022-07-20 05:19:11,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:11,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:11,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:11,430 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-20 05:19:11,464 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-20 05:19:11,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:11,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 05:19:11,501 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:11,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:19:11,525 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-20 05:19:11,528 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-20 05:19:11,777 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-20 05:19:11,778 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:12,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:19:12,115 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-20 05:19:12,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [540218197] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:12,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:12,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-20 05:19:12,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509600644] [2022-07-20 05:19:12,116 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:12,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:19:12,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:12,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:19:12,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:19:12,117 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:13,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:13,430 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-20 05:19:13,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:19:13,431 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 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 19 [2022-07-20 05:19:13,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:13,431 INFO L225 Difference]: With dead ends: 53 [2022-07-20 05:19:13,431 INFO L226 Difference]: Without dead ends: 24 [2022-07-20 05:19:13,432 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:19:13,432 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:13,432 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 226 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:19:13,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-20 05:19:13,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-20 05:19:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-20 05:19:13,433 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2022-07-20 05:19:13,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:13,433 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-20 05:19:13,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:13,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-20 05:19:13,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 05:19:13,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:13,434 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:13,453 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-20 05:19:13,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:13,634 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:13,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:13,635 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2022-07-20 05:19:13,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:13,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692585533] [2022-07-20 05:19:13,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:13,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:13,688 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-20 05:19:13,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692585533] [2022-07-20 05:19:13,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692585533] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:13,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2087831261] [2022-07-20 05:19:13,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:13,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:13,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:13,690 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-20 05:19:13,691 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-20 05:19:13,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:13,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 05:19:13,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:13,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:19:13,752 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-20 05:19:13,755 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-20 05:19:13,844 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-20 05:19:13,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:13,968 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-20 05:19:13,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2087831261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:13,968 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:13,968 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-20 05:19:13,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592783973] [2022-07-20 05:19:13,968 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:13,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:19:13,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:13,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:19:13,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:19:13,969 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:14,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:14,100 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-20 05:19:14,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:19:14,100 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 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 19 [2022-07-20 05:19:14,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:14,100 INFO L225 Difference]: With dead ends: 25 [2022-07-20 05:19:14,100 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 05:19:14,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-20 05:19:14,101 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:14,101 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:19:14,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 05:19:14,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-20 05:19:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 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-20 05:19:14,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-20 05:19:14,102 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-07-20 05:19:14,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:14,103 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-20 05:19:14,103 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:14,103 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-20 05:19:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 05:19:14,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:14,103 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:14,122 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-20 05:19:14,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:14,320 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:14,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:14,320 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2022-07-20 05:19:14,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:14,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020554907] [2022-07-20 05:19:14,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:14,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:14,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:14,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:14,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:14,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020554907] [2022-07-20 05:19:14,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020554907] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:14,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1031635955] [2022-07-20 05:19:14,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:19:14,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:14,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:14,477 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-20 05:19:14,529 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-20 05:19:14,562 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:19:14,563 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:14,564 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 05:19:14,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:14,569 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-20 05:19:14,618 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-20 05:19:14,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:14,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:14,892 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-20 05:19:14,991 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:14,991 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:15,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-20 05:19:15,222 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (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_243) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)))) is different from false [2022-07-20 05:19:15,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:15,244 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-20 05:19:15,252 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:15,253 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-20 05:19:15,257 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-20 05:19:15,267 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-20 05:19:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 05:19:15,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1031635955] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:15,368 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:15,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-20 05:19:15,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432406110] [2022-07-20 05:19:15,369 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:15,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:19:15,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:15,370 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:19:15,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=952, Unknown=3, NotChecked=126, Total=1190 [2022-07-20 05:19:15,370 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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-20 05:19:15,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:15,795 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-20 05:19:15,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:19:15,796 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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) Word has length 22 [2022-07-20 05:19:15,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:15,796 INFO L225 Difference]: With dead ends: 46 [2022-07-20 05:19:15,796 INFO L226 Difference]: Without dead ends: 36 [2022-07-20 05:19:15,797 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=202, Invalid=1783, Unknown=3, NotChecked=174, Total=2162 [2022-07-20 05:19:15,797 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 115 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:15,797 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 127 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 115 Unchecked, 0.1s Time] [2022-07-20 05:19:15,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-20 05:19:15,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-20 05:19:15,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:15,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-20 05:19:15,798 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-07-20 05:19:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:15,798 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-20 05:19:15,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 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-20 05:19:15,798 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-20 05:19:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 05:19:15,799 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:15,799 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:15,816 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-20 05:19:15,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:15,999 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:16,000 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2022-07-20 05:19:16,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:16,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239030201] [2022-07-20 05:19:16,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:16,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:16,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:16,254 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:16,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:16,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239030201] [2022-07-20 05:19:16,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239030201] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:16,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [334555247] [2022-07-20 05:19:16,254 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:19:16,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:16,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:16,255 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-20 05:19:16,270 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-20 05:19:16,344 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:19:16,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:16,345 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-20 05:19:16,347 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:16,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 10 treesize of output 8 [2022-07-20 05:19:16,443 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-20 05:19:16,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:16,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 14 treesize of output 16 [2022-07-20 05:19:16,611 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-20 05:19:16,613 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:16,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:16,622 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:19:16,633 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:16,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:16,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:16,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:16,657 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:16,658 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-20 05:19:16,664 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:16,664 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-20 05:19:16,666 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-20 05:19:16,828 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-20 05:19:16,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [334555247] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:16,828 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:16,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2022-07-20 05:19:16,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106392383] [2022-07-20 05:19:16,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:16,829 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 05:19:16,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:16,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 05:19:16,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2022-07-20 05:19:16,830 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:17,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:17,204 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-20 05:19:17,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 05:19:17,206 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-20 05:19:17,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:17,206 INFO L225 Difference]: With dead ends: 52 [2022-07-20 05:19:17,207 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:19:17,207 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2022-07-20 05:19:17,207 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:17,208 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-20 05:19:17,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:19:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-20 05:19:17,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:17,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-20 05:19:17,209 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-07-20 05:19:17,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:17,209 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-20 05:19:17,209 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:17,209 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-20 05:19:17,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:19:17,210 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:17,210 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:17,243 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-20 05:19:17,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:17,423 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-20 05:19:17,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:17,424 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2022-07-20 05:19:17,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:17,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434870511] [2022-07-20 05:19:17,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:17,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:17,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:17,534 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:17,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:17,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434870511] [2022-07-20 05:19:17,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434870511] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:17,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716336386] [2022-07-20 05:19:17,534 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:19:17,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:17,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:17,536 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-20 05:19:17,537 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-20 05:19:17,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:19:17,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:17,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-20 05:19:17,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:17,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:19:17,632 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-20 05:19:17,766 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 16 treesize of output 12 [2022-07-20 05:19:17,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:17,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:18,001 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:18,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:19:18,083 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:18,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:18,487 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:18,488 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-20 05:19:18,493 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:18,494 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-20 05:19:18,496 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-20 05:19:18,735 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716336386] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:18,735 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:18,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2022-07-20 05:19:18,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735813467] [2022-07-20 05:19:18,736 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:18,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-20 05:19:18,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:18,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-20 05:19:18,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=1518, Unknown=1, NotChecked=0, Total=1722 [2022-07-20 05:19:18,737 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:19,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:19,601 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-20 05:19:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 05:19:19,601 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 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 34 [2022-07-20 05:19:19,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:19,601 INFO L225 Difference]: With dead ends: 43 [2022-07-20 05:19:19,602 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:19:19,602 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=492, Invalid=2925, Unknown=5, NotChecked=0, Total=3422 [2022-07-20 05:19:19,602 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 125 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:19,603 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 165 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 125 Unchecked, 0.2s Time] [2022-07-20 05:19:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:19:19,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-20 05:19:19,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:19,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-20 05:19:19,604 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-20 05:19:19,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:19,604 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-20 05:19:19,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:19,604 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-20 05:19:19,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:19:19,604 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:19,604 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:19,621 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-20 05:19:19,804 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:19,805 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:19,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:19,805 INFO L85 PathProgramCache]: Analyzing trace with hash 2031773033, now seen corresponding path program 5 times [2022-07-20 05:19:19,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:19,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153220893] [2022-07-20 05:19:19,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:19,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:19,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:19,935 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:19,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:19,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153220893] [2022-07-20 05:19:19,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [153220893] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:19,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [518808080] [2022-07-20 05:19:19,936 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:19:19,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:19,936 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:19,952 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-20 05:19:19,959 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-20 05:19:20,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 05:19:20,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:20,100 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:19:20,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:20,113 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:19:20,113 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-20 05:19:20,355 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:20,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:20,535 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:20,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [518808080] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:20,535 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:20,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-20 05:19:20,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367024114] [2022-07-20 05:19:20,535 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:20,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:19:20,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:20,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:19:20,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-07-20 05:19:20,536 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:20,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:20,868 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-20 05:19:20,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:19:20,868 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 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 42 [2022-07-20 05:19:20,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:20,868 INFO L225 Difference]: With dead ends: 70 [2022-07-20 05:19:20,868 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 05:19:20,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-07-20 05:19:20,869 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:20,869 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 101 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:19:20,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 05:19:20,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-20 05:19:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 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-20 05:19:20,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-20 05:19:20,871 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-07-20 05:19:20,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:20,871 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-20 05:19:20,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:20,871 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-20 05:19:20,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-20 05:19:20,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:20,871 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:20,892 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-20 05:19:21,071 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,SelfDestructingSolverStorable23 [2022-07-20 05:19:21,072 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-20 05:19:21,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:21,072 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 6 times [2022-07-20 05:19:21,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:21,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713523314] [2022-07-20 05:19:21,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:21,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:21,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:21,477 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:21,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713523314] [2022-07-20 05:19:21,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713523314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:21,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560203769] [2022-07-20 05:19:21,478 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:19:21,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:21,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:21,479 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-20 05:19:21,480 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-20 05:19:21,596 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 05:19:21,596 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:21,599 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-20 05:19:21,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:21,605 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-20 05:19:21,787 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-20 05:19:21,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:21,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:21,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:22,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:19:22,049 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-20 05:19:22,051 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:22,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:22,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:19:22,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)))) is different from false [2022-07-20 05:19:22,069 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_434) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:22,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:22,079 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_433) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:22,084 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:22,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_432) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:22,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:22,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:19:22,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:22,112 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-20 05:19:22,116 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:22,117 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-20 05:19:22,119 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-20 05:19:22,301 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-20 05:19:22,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560203769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:22,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:22,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 50 [2022-07-20 05:19:22,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [429796709] [2022-07-20 05:19:22,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:22,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 05:19:22,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:22,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 05:19:22,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1525, Unknown=9, NotChecked=774, Total=2450 [2022-07-20 05:19:22,303 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:22,975 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-20 05:19:22,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-20 05:19:22,975 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 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 46 [2022-07-20 05:19:22,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:22,976 INFO L225 Difference]: With dead ends: 76 [2022-07-20 05:19:22,976 INFO L226 Difference]: Without dead ends: 54 [2022-07-20 05:19:22,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=215, Invalid=2464, Unknown=9, NotChecked=972, Total=3660 [2022-07-20 05:19:22,977 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:22,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 396 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-07-20 05:19:22,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-20 05:19:22,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-20 05:19:22,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:22,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-20 05:19:22,978 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-07-20 05:19:22,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:22,978 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-20 05:19:22,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:22,978 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-20 05:19:22,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:19:22,978 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:22,979 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:22,996 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-20 05:19:23,179 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,SelfDestructingSolverStorable24 [2022-07-20 05:19:23,179 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-20 05:19:23,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 7 times [2022-07-20 05:19:23,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:23,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146659240] [2022-07-20 05:19:23,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:23,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:23,422 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:23,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:23,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146659240] [2022-07-20 05:19:23,423 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [146659240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:23,423 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1641393612] [2022-07-20 05:19:23,423 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:19:23,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:23,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:23,424 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-20 05:19:23,425 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-20 05:19:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:23,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-20 05:19:23,507 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:23,688 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:23,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:23,842 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-20 05:19:23,862 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:23,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1641393612] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:23,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:23,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-20 05:19:23,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665685986] [2022-07-20 05:19:23,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:23,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-20 05:19:23,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:23,863 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-20 05:19:23,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-20 05:19:23,864 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:24,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:24,249 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-20 05:19:24,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:19:24,250 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 05:19:24,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:24,250 INFO L225 Difference]: With dead ends: 57 [2022-07-20 05:19:24,250 INFO L226 Difference]: Without dead ends: 57 [2022-07-20 05:19:24,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-20 05:19:24,251 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:24,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 192 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:19:24,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-20 05:19:24,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-20 05:19:24,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-20 05:19:24,252 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-07-20 05:19:24,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:24,255 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-20 05:19:24,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:24,255 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-20 05:19:24,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-20 05:19:24,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:24,256 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:24,272 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-20 05:19:24,456 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,SelfDestructingSolverStorable25 [2022-07-20 05:19:24,456 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-20 05:19:24,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:24,457 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 8 times [2022-07-20 05:19:24,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:24,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42889413] [2022-07-20 05:19:24,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:24,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:24,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:24,932 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:24,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:24,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42889413] [2022-07-20 05:19:24,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [42889413] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:24,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [183629919] [2022-07-20 05:19:24,932 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:19:24,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:24,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:24,934 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-20 05:19:24,935 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-20 05:19:25,031 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:19:25,031 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:25,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-20 05:19:25,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:25,039 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-20 05:19:25,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, 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-20 05:19:25,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:25,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:19:25,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:25,716 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:19:25,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:26,038 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:26,038 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-20 05:19:26,170 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:26,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:26,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-20 05:19:26,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (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_556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-20 05:19:26,885 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:26,885 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-20 05:19:26,890 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:26,890 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-20 05:19:26,893 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-20 05:19:26,896 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-20 05:19:27,312 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 05:19:27,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [183629919] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:27,313 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:27,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2022-07-20 05:19:27,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [577100623] [2022-07-20 05:19:27,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:27,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-20 05:19:27,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:27,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-20 05:19:27,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=368, Invalid=4889, Unknown=7, NotChecked=286, Total=5550 [2022-07-20 05:19:27,315 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:29,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:29,073 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-20 05:19:29,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-20 05:19:29,074 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 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 54 [2022-07-20 05:19:29,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:29,074 INFO L225 Difference]: With dead ends: 94 [2022-07-20 05:19:29,074 INFO L226 Difference]: Without dead ends: 68 [2022-07-20 05:19:29,076 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=801, Invalid=9502, Unknown=7, NotChecked=402, Total=10712 [2022-07-20 05:19:29,076 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 1066 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 566 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:29,076 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 421 Invalid, 1066 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 566 Unchecked, 0.1s Time] [2022-07-20 05:19:29,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-20 05:19:29,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-07-20 05:19:29,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:29,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-20 05:19:29,077 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2022-07-20 05:19:29,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:29,078 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-20 05:19:29,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:29,078 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-20 05:19:29,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-20 05:19:29,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:29,078 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:29,095 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-20 05:19:29,279 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,SelfDestructingSolverStorable26 [2022-07-20 05:19:29,279 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-20 05:19:29,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:29,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1063800910, now seen corresponding path program 9 times [2022-07-20 05:19:29,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:29,280 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451773599] [2022-07-20 05:19:29,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:29,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:29,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:29,927 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:29,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:29,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451773599] [2022-07-20 05:19:29,927 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451773599] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:29,927 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2101920231] [2022-07-20 05:19:29,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:19:29,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:29,928 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:29,930 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-20 05:19:29,931 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-20 05:19:30,168 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-20 05:19:30,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:30,173 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-20 05:19:30,176 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:30,180 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-20 05:19:30,343 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:19:30,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:30,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:30,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:30,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 14 treesize of output 16 [2022-07-20 05:19:30,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:30,750 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:19:30,822 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-20 05:19:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:30,824 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:30,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:19:30,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:30,841 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_631) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:30,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_630) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,854 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,858 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_629) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,867 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_628) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_627) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,880 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:30,886 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:30,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, 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-20 05:19:30,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:30,891 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-20 05:19:30,893 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-20 05:19:31,220 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 83 not checked. [2022-07-20 05:19:31,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2101920231] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:31,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:31,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 69 [2022-07-20 05:19:31,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202577946] [2022-07-20 05:19:31,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:31,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 05:19:31,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:31,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 05:19:31,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-20 05:19:31,223 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 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-20 05:19:32,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:32,288 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-20 05:19:32,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 05:19:32,288 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 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 62 [2022-07-20 05:19:32,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:32,289 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:19:32,289 INFO L226 Difference]: Without dead ends: 70 [2022-07-20 05:19:32,291 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 85 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=288, Invalid=4581, Unknown=13, NotChecked=1924, Total=6806 [2022-07-20 05:19:32,291 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:32,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 573 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1303 Invalid, 0 Unknown, 678 Unchecked, 0.4s Time] [2022-07-20 05:19:32,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-20 05:19:32,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-20 05:19:32,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:32,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-20 05:19:32,293 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-07-20 05:19:32,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:32,293 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-20 05:19:32,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 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-20 05:19:32,293 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-20 05:19:32,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 05:19:32,293 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:32,294 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:32,311 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-20 05:19:32,511 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,SelfDestructingSolverStorable27 [2022-07-20 05:19:32,511 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-20 05:19:32,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:32,512 INFO L85 PathProgramCache]: Analyzing trace with hash 397481487, now seen corresponding path program 10 times [2022-07-20 05:19:32,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:32,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105946726] [2022-07-20 05:19:32,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:32,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:32,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:32,798 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:32,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:32,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105946726] [2022-07-20 05:19:32,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105946726] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:32,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390886942] [2022-07-20 05:19:32,799 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:19:32,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:32,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:32,804 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-20 05:19:32,830 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-20 05:19:32,929 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:19:32,930 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:32,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-20 05:19:32,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:32,944 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:19:32,945 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-20 05:19:32,950 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-20 05:19:33,255 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 16 treesize of output 12 [2022-07-20 05:19:33,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:19:33,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:33,918 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:19:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:34,050 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:34,959 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-20 05:19:34,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (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_713) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0))) is different from false [2022-07-20 05:19:34,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:34,976 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-20 05:19:34,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:34,982 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-20 05:19:34,992 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-20 05:19:35,875 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-20 05:19:35,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390886942] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:35,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:35,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 28] total 74 [2022-07-20 05:19:35,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869561151] [2022-07-20 05:19:35,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:35,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-20 05:19:35,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:35,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-20 05:19:35,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4717, Unknown=7, NotChecked=286, Total=5550 [2022-07-20 05:19:35,879 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:37,522 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1))) (and (<= .cse0 .cse1) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 7) (<= 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= 7 .cse1) (or (= |c_ULTIMATE.start_cstrncpy_#t~mem5#1| 0) (not (= (+ (- 1) .cse1) (+ (- 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (or (and (<= (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse1) (<= 0 .cse0)) (forall ((v_ArrVal_713 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))))) is different from false [2022-07-20 05:19:37,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:37,727 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-20 05:19:37,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-20 05:19:37,727 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-20 05:19:37,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:37,728 INFO L225 Difference]: With dead ends: 75 [2022-07-20 05:19:37,728 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:19:37,728 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1672 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=1396, Invalid=8281, Unknown=37, NotChecked=588, Total=10302 [2022-07-20 05:19:37,729 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:37,729 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 940 Invalid, 0 Unknown, 532 Unchecked, 0.4s Time] [2022-07-20 05:19:37,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:19:37,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-20 05:19:37,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:37,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-20 05:19:37,730 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-20 05:19:37,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:37,730 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-20 05:19:37,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:37,731 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-20 05:19:37,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 05:19:37,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:37,731 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:37,751 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-20 05:19:37,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 05:19:37,931 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-20 05:19:37,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:37,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2032213951, now seen corresponding path program 11 times [2022-07-20 05:19:37,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:37,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38128215] [2022-07-20 05:19:37,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:37,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:37,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:38,179 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 139 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:38,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:38,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38128215] [2022-07-20 05:19:38,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [38128215] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:38,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1653246877] [2022-07-20 05:19:38,179 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:19:38,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:38,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:38,180 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-20 05:19:38,181 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-20 05:19:38,542 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-20 05:19:38,543 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:38,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-20 05:19:38,549 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:38,558 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:19:38,559 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-20 05:19:39,088 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:39,088 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:39,399 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:39,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1653246877] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:39,399 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:39,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2022-07-20 05:19:39,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821753136] [2022-07-20 05:19:39,400 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:39,400 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 05:19:39,400 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:39,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 05:19:39,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2138, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:19:39,401 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:40,045 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-07-20 05:19:40,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:19:40,046 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 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 74 [2022-07-20 05:19:40,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:40,046 INFO L225 Difference]: With dead ends: 118 [2022-07-20 05:19:40,046 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 05:19:40,047 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-07-20 05:19:40,047 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:40,048 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:19:40,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 05:19:40,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-20 05:19:40,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:40,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-20 05:19:40,049 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-07-20 05:19:40,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:40,049 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-20 05:19:40,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:40,049 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-20 05:19:40,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-20 05:19:40,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:40,050 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:40,070 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-20 05:19:40,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:40,259 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-20 05:19:40,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:40,260 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 12 times [2022-07-20 05:19:40,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:40,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993986562] [2022-07-20 05:19:40,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:40,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:40,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:41,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993986562] [2022-07-20 05:19:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993986562] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307175539] [2022-07-20 05:19:41,117 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:19:41,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:41,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:41,118 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-20 05:19:41,120 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-20 05:19:41,732 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-20 05:19:41,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:41,738 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-20 05:19:41,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:41,757 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-20 05:19:42,145 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-20 05:19:42,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,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-20 05:19:42,405 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:19:42,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,614 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:42,632 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-20 05:19:42,634 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:42,634 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:42,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:19:42,647 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:42,651 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_885) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:42,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,661 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_884) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,670 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_883) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,675 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,680 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_882) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_881) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,708 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_879) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:42,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:42,727 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-20 05:19:42,732 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:42,732 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-20 05:19:42,735 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-20 05:19:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-20 05:19:43,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307175539] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:43,004 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:43,005 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 80 [2022-07-20 05:19:43,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220047012] [2022-07-20 05:19:43,005 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:43,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-20 05:19:43,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:43,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-20 05:19:43,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3735, Unknown=17, NotChecked=2346, Total=6320 [2022-07-20 05:19:43,006 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:44,363 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2022-07-20 05:19:44,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:19:44,363 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-20 05:19:44,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:44,364 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:19:44,364 INFO L226 Difference]: Without dead ends: 86 [2022-07-20 05:19:44,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=353, Invalid=6504, Unknown=17, NotChecked=3026, Total=9900 [2022-07-20 05:19:44,365 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:44,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1731 Invalid, 0 Unknown, 1153 Unchecked, 0.4s Time] [2022-07-20 05:19:44,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-20 05:19:44,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-20 05:19:44,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:44,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-20 05:19:44,366 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-07-20 05:19:44,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:44,366 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-20 05:19:44,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:44,366 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-20 05:19:44,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-20 05:19:44,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:44,367 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:44,386 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-07-20 05:19:44,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:44,575 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-20 05:19:44,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:44,576 INFO L85 PathProgramCache]: Analyzing trace with hash -605311109, now seen corresponding path program 13 times [2022-07-20 05:19:44,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:44,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266053265] [2022-07-20 05:19:44,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:44,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:44,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:44,843 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:44,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:44,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266053265] [2022-07-20 05:19:44,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266053265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:44,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604844282] [2022-07-20 05:19:44,844 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:19:44,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:44,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:44,845 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-20 05:19:44,846 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-20 05:19:44,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:45,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-20 05:19:45,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:45,327 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:45,327 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:45,713 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-20 05:19:45,781 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:45,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [604844282] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:45,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:45,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2022-07-20 05:19:45,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564664941] [2022-07-20 05:19:45,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:45,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 05:19:45,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:45,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 05:19:45,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:19:45,782 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:46,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:46,596 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-20 05:19:46,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-20 05:19:46,596 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 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 82 [2022-07-20 05:19:46,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:46,596 INFO L225 Difference]: With dead ends: 89 [2022-07-20 05:19:46,596 INFO L226 Difference]: Without dead ends: 89 [2022-07-20 05:19:46,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2022-07-20 05:19:46,597 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 381 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:46,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 364 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:19:46,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-20 05:19:46,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-20 05:19:46,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:46,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-20 05:19:46,599 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-07-20 05:19:46,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:46,599 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-20 05:19:46,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:46,599 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-20 05:19:46,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-20 05:19:46,600 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:46,600 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:46,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-20 05:19:46,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:46,801 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-20 05:19:46,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:46,801 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 14 times [2022-07-20 05:19:46,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:46,801 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779842693] [2022-07-20 05:19:46,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:46,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:47,823 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:47,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779842693] [2022-07-20 05:19:47,824 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779842693] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:47,824 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172107646] [2022-07-20 05:19:47,824 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:19:47,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:47,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:47,825 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-20 05:19:47,827 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-20 05:19:48,003 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:19:48,003 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:48,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 169 conjunts are in the unsatisfiable core [2022-07-20 05:19:48,010 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:48,014 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-20 05:19:48,375 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-20 05:19:48,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:48,712 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:48,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:48,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,374 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:49,789 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:49,789 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-20 05:19:49,925 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:49,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:51,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-20 05:19:51,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (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_1074) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|))) is different from false [2022-07-20 05:19:51,362 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:51,362 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-20 05:19:51,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:51,366 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-20 05:19:51,369 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-20 05:19:51,371 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-20 05:19:52,015 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-20 05:19:52,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172107646] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:19:52,016 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:19:52,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 115 [2022-07-20 05:19:52,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711963394] [2022-07-20 05:19:52,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:19:52,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-07-20 05:19:52,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:19:52,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-07-20 05:19:52,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=11888, Unknown=10, NotChecked=446, Total=13110 [2022-07-20 05:19:52,018 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:55,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:19:55,242 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-20 05:19:55,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-20 05:19:55,243 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-20 05:19:55,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:19:55,243 INFO L225 Difference]: With dead ends: 142 [2022-07-20 05:19:55,243 INFO L226 Difference]: Without dead ends: 100 [2022-07-20 05:19:55,245 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4841 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1639, Invalid=23165, Unknown=10, NotChecked=626, Total=25440 [2022-07-20 05:19:55,245 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1156 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:19:55,245 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 782 Invalid, 1965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 793 Invalid, 0 Unknown, 1156 Unchecked, 0.2s Time] [2022-07-20 05:19:55,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-20 05:19:55,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-20 05:19:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:55,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-20 05:19:55,247 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2022-07-20 05:19:55,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:19:55,247 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-20 05:19:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:19:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-20 05:19:55,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-20 05:19:55,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:19:55,248 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:19:55,268 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-20 05:19:55,466 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:55,466 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-20 05:19:55,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:19:55,466 INFO L85 PathProgramCache]: Analyzing trace with hash -486951286, now seen corresponding path program 15 times [2022-07-20 05:19:55,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:19:55,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004417656] [2022-07-20 05:19:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:19:55,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:19:55,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:19:56,683 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:56,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:19:56,683 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004417656] [2022-07-20 05:19:56,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004417656] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:19:56,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810888838] [2022-07-20 05:19:56,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:19:56,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:19:56,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:19:56,685 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-20 05:19:56,686 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-20 05:19:58,567 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-20 05:19:58,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:19:58,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-20 05:19:58,586 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:19:58,590 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-20 05:19:59,108 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-20 05:19:59,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:59,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-20 05:19:59,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:59,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-20 05:19:59,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:19:59,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:59,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:19:59,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-20 05:19:59,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:19:59,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 05:19:59,775 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-20 05:19:59,777 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:19:59,777 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:19:59,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:19:59,788 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:59,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1184) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:19:59,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,801 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1183) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,805 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,810 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1182) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:19:59,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1181) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,822 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1180) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,835 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1179) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1178) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,848 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:19:59,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:19:59,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:19:59,872 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:59,872 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-20 05:19:59,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:19:59,876 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-20 05:19:59,878 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-20 05:20:00,175 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 219 not checked. [2022-07-20 05:20:00,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810888838] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:00,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:00,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39, 39] total 96 [2022-07-20 05:20:00,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161990036] [2022-07-20 05:20:00,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:00,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-20 05:20:00,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:00,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-20 05:20:00,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5347, Unknown=21, NotChecked=3486, Total=9120 [2022-07-20 05:20:00,177 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:02,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:02,030 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2022-07-20 05:20:02,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-20 05:20:02,030 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-20 05:20:02,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:02,031 INFO L225 Difference]: With dead ends: 148 [2022-07-20 05:20:02,031 INFO L226 Difference]: Without dead ends: 102 [2022-07-20 05:20:02,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 137 SyntacticMatches, 21 SemanticMatches, 116 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=398, Invalid=8977, Unknown=21, NotChecked=4410, Total=13806 [2022-07-20 05:20:02,032 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1735 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:02,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1068 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2380 Invalid, 0 Unknown, 1735 Unchecked, 0.6s Time] [2022-07-20 05:20:02,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-20 05:20:02,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-20 05:20:02,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-20 05:20:02,033 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-07-20 05:20:02,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:02,033 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-20 05:20:02,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:02,033 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-20 05:20:02,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-20 05:20:02,034 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:02,034 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:02,058 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-20 05:20:02,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:02,247 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-20 05:20:02,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:02,248 INFO L85 PathProgramCache]: Analyzing trace with hash 1113221351, now seen corresponding path program 16 times [2022-07-20 05:20:02,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:02,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292323567] [2022-07-20 05:20:02,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:02,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:02,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:02,684 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 153 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:02,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292323567] [2022-07-20 05:20:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292323567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786694907] [2022-07-20 05:20:02,684 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:20:02,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:02,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:02,685 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-20 05:20:02,691 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-20 05:20:02,852 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:20:02,852 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:20:02,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 192 conjunts are in the unsatisfiable core [2022-07-20 05:20:02,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:02,869 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:20:02,869 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-20 05:20:02,875 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-20 05:20:03,439 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 16 treesize of output 12 [2022-07-20 05:20:03,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:03,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:03,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:03,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,041 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,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 18 treesize of output 20 [2022-07-20 05:20:04,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:20:04,772 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:04,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:20:04,941 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:04,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:06,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-20 05:20:06,590 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (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_1303) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-20 05:20:06,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:06,595 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-20 05:20:06,600 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:06,600 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-20 05:20:06,603 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-20 05:20:08,221 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-20 05:20:08,221 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786694907] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:08,221 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:08,221 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40, 40] total 106 [2022-07-20 05:20:08,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279667397] [2022-07-20 05:20:08,222 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:08,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-07-20 05:20:08,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:08,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-07-20 05:20:08,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1080, Invalid=9837, Unknown=11, NotChecked=414, Total=11342 [2022-07-20 05:20:08,223 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:11,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:11,416 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-20 05:20:11,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-20 05:20:11,416 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-20 05:20:11,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:11,417 INFO L225 Difference]: With dead ends: 107 [2022-07-20 05:20:11,417 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 05:20:11,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 118 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3849 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2859, Invalid=17104, Unknown=67, NotChecked=562, Total=20592 [2022-07-20 05:20:11,418 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 266 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 3131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1163 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:11,419 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 870 Invalid, 3131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1724 Invalid, 0 Unknown, 1163 Unchecked, 0.5s Time] [2022-07-20 05:20:11,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 05:20:11,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-20 05:20:11,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:11,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-20 05:20:11,420 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2022-07-20 05:20:11,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:11,421 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-20 05:20:11,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:11,421 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-20 05:20:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-20 05:20:11,421 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:11,421 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:11,439 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-20 05:20:11,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:11,625 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-20 05:20:11,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:11,625 INFO L85 PathProgramCache]: Analyzing trace with hash -36447463, now seen corresponding path program 17 times [2022-07-20 05:20:11,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:11,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462477767] [2022-07-20 05:20:11,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:11,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:11,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:12,048 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 303 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:12,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462477767] [2022-07-20 05:20:12,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462477767] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:12,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [522514367] [2022-07-20 05:20:12,048 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:20:12,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:12,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:12,050 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-20 05:20:12,051 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-20 05:20:14,013 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-20 05:20:14,013 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:20:14,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-20 05:20:14,025 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:14,036 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:20:14,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-20 05:20:14,910 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:14,911 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:15,428 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:15,429 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [522514367] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:15,429 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:15,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 72 [2022-07-20 05:20:15,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394358948] [2022-07-20 05:20:15,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:15,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-20 05:20:15,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:15,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-20 05:20:15,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=4233, Unknown=0, NotChecked=0, Total=5112 [2022-07-20 05:20:15,431 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:15,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:15,856 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2022-07-20 05:20:15,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:20:15,856 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-20 05:20:15,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:15,857 INFO L225 Difference]: With dead ends: 166 [2022-07-20 05:20:15,857 INFO L226 Difference]: Without dead ends: 114 [2022-07-20 05:20:15,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1509, Invalid=6147, Unknown=0, NotChecked=0, Total=7656 [2022-07-20 05:20:15,859 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:15,860 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 242 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:20:15,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-20 05:20:15,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-07-20 05:20:15,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:15,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-07-20 05:20:15,862 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-07-20 05:20:15,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:15,862 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-07-20 05:20:15,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:15,863 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-07-20 05:20:15,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-20 05:20:15,863 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:15,863 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:15,883 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-20 05:20:16,083 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,SelfDestructingSolverStorable35 [2022-07-20 05:20:16,083 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-20 05:20:16,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:16,084 INFO L85 PathProgramCache]: Analyzing trace with hash 223537654, now seen corresponding path program 18 times [2022-07-20 05:20:16,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:16,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577056461] [2022-07-20 05:20:16,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:16,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:16,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:17,501 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:17,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:17,501 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577056461] [2022-07-20 05:20:17,501 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577056461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:17,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1021829573] [2022-07-20 05:20:17,502 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:20:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:17,503 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-20 05:20:17,504 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-20 05:20:20,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-20 05:20:20,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:20:20,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 290 conjunts are in the unsatisfiable core [2022-07-20 05:20:20,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:20,638 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-20 05:20:21,183 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-20 05:20:21,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:21,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:21,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:21,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:21,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:21,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:22,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:22,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:22,262 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:22,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 05:20:22,514 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:20:22,631 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:22,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:20:22,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:22,737 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-20 05:20:22,740 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:22,740 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:22,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:20:22,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:20:22,756 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1543) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:20:22,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,763 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1542) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,773 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1541) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,780 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,783 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1540) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,786 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:20:22,789 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1539) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,793 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,796 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1538) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,799 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,803 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1537) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,806 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:20:22,814 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1536) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,818 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:20:22,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1535) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:20:22,827 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1534) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:20:22,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:20:22,834 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1533) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:20:22,837 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,840 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:22,842 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:22,842 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-20 05:20:22,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:22,845 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-20 05:20:22,846 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-20 05:20:23,630 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-20 05:20:23,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1021829573] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:23,630 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:23,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 139 [2022-07-20 05:20:23,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37338439] [2022-07-20 05:20:23,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:23,631 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-20 05:20:23,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:23,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-20 05:20:23,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=12535, Unknown=25, NotChecked=6200, Total=19182 [2022-07-20 05:20:23,632 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:26,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:26,365 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-20 05:20:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-20 05:20:26,365 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-20 05:20:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:26,366 INFO L225 Difference]: With dead ends: 172 [2022-07-20 05:20:26,366 INFO L226 Difference]: Without dead ends: 118 [2022-07-20 05:20:26,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 170 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 6609 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=653, Invalid=20884, Unknown=25, NotChecked=7850, Total=29412 [2022-07-20 05:20:26,368 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2923 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:26,368 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1759 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1989 Invalid, 0 Unknown, 2923 Unchecked, 0.6s Time] [2022-07-20 05:20:26,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-20 05:20:26,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-07-20 05:20:26,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:26,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-20 05:20:26,380 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-07-20 05:20:26,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:26,380 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-20 05:20:26,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:26,380 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-20 05:20:26,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-20 05:20:26,381 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:26,381 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:26,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-07-20 05:20:26,601 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,SelfDestructingSolverStorable36 [2022-07-20 05:20:26,601 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-20 05:20:26,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:26,601 INFO L85 PathProgramCache]: Analyzing trace with hash 382026323, now seen corresponding path program 19 times [2022-07-20 05:20:26,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:26,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621578673] [2022-07-20 05:20:26,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:26,602 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:26,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:27,092 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:27,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621578673] [2022-07-20 05:20:27,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621578673] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:27,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281262984] [2022-07-20 05:20:27,093 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:20:27,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:27,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:27,094 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-20 05:20:27,095 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-20 05:20:27,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:27,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-20 05:20:27,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:27,689 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:27,690 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:28,140 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-20 05:20:28,206 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:28,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281262984] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:28,206 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:28,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 65 [2022-07-20 05:20:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849931113] [2022-07-20 05:20:28,206 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:28,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-20 05:20:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-20 05:20:28,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3886, Unknown=0, NotChecked=0, Total=4290 [2022-07-20 05:20:28,208 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:29,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:29,650 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-07-20 05:20:29,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 05:20:29,650 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-20 05:20:29,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:29,651 INFO L225 Difference]: With dead ends: 121 [2022-07-20 05:20:29,651 INFO L226 Difference]: Without dead ends: 121 [2022-07-20 05:20:29,652 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2253, Invalid=9303, Unknown=0, NotChecked=0, Total=11556 [2022-07-20 05:20:29,652 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 442 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:29,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 696 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:20:29,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-20 05:20:29,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-20 05:20:29,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-20 05:20:29,657 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-20 05:20:29,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:29,657 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-20 05:20:29,657 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:29,657 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-20 05:20:29,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-20 05:20:29,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:29,658 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:29,677 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-20 05:20:29,875 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,SelfDestructingSolverStorable37 [2022-07-20 05:20:29,875 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-20 05:20:29,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:29,875 INFO L85 PathProgramCache]: Analyzing trace with hash -757002324, now seen corresponding path program 20 times [2022-07-20 05:20:29,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:29,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783394297] [2022-07-20 05:20:29,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:29,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:31,656 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:31,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:31,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783394297] [2022-07-20 05:20:31,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783394297] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:31,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620596109] [2022-07-20 05:20:31,657 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:20:31,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:31,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:31,658 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-20 05:20:31,659 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-20 05:20:31,864 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:20:31,864 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:20:31,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 227 conjunts are in the unsatisfiable core [2022-07-20 05:20:31,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:31,876 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-20 05:20:32,455 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-20 05:20:32,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 17 treesize of output 19 [2022-07-20 05:20:32,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:32,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:33,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:33,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 17 treesize of output 19 [2022-07-20 05:20:33,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:20:33,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:33,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:33,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:34,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:34,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 17 treesize of output 19 [2022-07-20 05:20:34,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:34,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:34,816 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:34,816 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-20 05:20:34,986 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:34,986 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:37,730 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:20:37,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (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_364|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0))) is different from false [2022-07-20 05:20:37,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:37,770 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-20 05:20:37,796 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:37,797 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-20 05:20:37,800 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-20 05:20:37,802 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-20 05:20:39,052 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-20 05:20:39,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620596109] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:20:39,053 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:20:39,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 155 [2022-07-20 05:20:39,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053679464] [2022-07-20 05:20:39,053 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:20:39,053 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-07-20 05:20:39,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:20:39,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-07-20 05:20:39,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=21940, Unknown=16, NotChecked=606, Total=23870 [2022-07-20 05:20:39,055 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:48,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:20:48,131 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-20 05:20:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-20 05:20:48,131 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 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 118 [2022-07-20 05:20:48,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:20:48,132 INFO L225 Difference]: With dead ends: 190 [2022-07-20 05:20:48,132 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 05:20:48,134 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 9252 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=2749, Invalid=42825, Unknown=16, NotChecked=850, Total=46440 [2022-07-20 05:20:48,134 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 174 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 2653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1188 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:20:48,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1566 Invalid, 2653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1448 Invalid, 0 Unknown, 1188 Unchecked, 0.5s Time] [2022-07-20 05:20:48,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 05:20:48,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-20 05:20:48,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:48,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-07-20 05:20:48,138 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2022-07-20 05:20:48,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:20:48,138 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-07-20 05:20:48,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:20:48,138 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-07-20 05:20:48,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-20 05:20:48,139 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:20:48,139 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:20:48,157 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-20 05:20:48,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:48,352 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-20 05:20:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:20:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1971076450, now seen corresponding path program 21 times [2022-07-20 05:20:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:20:48,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018956426] [2022-07-20 05:20:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:20:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:20:48,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:20:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:49,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:20:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018956426] [2022-07-20 05:20:49,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2018956426] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:20:49,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218226407] [2022-07-20 05:20:49,877 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:20:49,877 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:20:49,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:20:49,878 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-20 05:20:49,879 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-20 05:20:56,406 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-20 05:20:56,406 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:20:56,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 328 conjunts are in the unsatisfiable core [2022-07-20 05:20:56,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:20:56,444 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:20:57,521 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-20 05:20:57,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:57,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,110 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,247 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,756 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:58,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:59,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:20:59,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:20:59,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-20 05:20:59,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:20:59,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-20 05:20:59,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:20:59,893 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:20:59,895 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:20:59,895 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-20 05:20:59,897 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:20:59,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:20:59,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:20:59,906 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:20:59,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1947) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:20:59,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1946) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,924 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1945) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1944) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,945 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1943) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,955 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1942) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,970 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1941) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1940) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:20:59,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1939) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:20:59,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:21:00,001 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1938) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:21:00,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:21:00,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1937) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:21:00,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1936) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,028 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1935) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,041 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:21:00,045 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:21:00,045 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-20 05:21:00,050 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:21:00,050 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-20 05:21:00,052 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-20 05:21:01,085 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 419 not checked. [2022-07-20 05:21:01,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218226407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:21:01,085 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:21:01,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 51, 51] total 159 [2022-07-20 05:21:01,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645556084] [2022-07-20 05:21:01,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:21:01,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-07-20 05:21:01,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:21:01,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-07-20 05:21:01,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=16375, Unknown=29, NotChecked=8236, Total=25122 [2022-07-20 05:21:01,088 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:04,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:21:04,752 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2022-07-20 05:21:04,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-20 05:21:04,753 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 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 126 [2022-07-20 05:21:04,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:21:04,753 INFO L225 Difference]: With dead ends: 196 [2022-07-20 05:21:04,753 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 05:21:04,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 199 ConstructedPredicates, 29 IntricatePredicates, 13 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=775, Invalid=28724, Unknown=29, NotChecked=10672, Total=40200 [2022-07-20 05:21:04,755 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 5308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2894 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:21:04,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 2161 Invalid, 5308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2397 Invalid, 0 Unknown, 2894 Unchecked, 0.5s Time] [2022-07-20 05:21:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 05:21:04,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-07-20 05:21:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:04,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-07-20 05:21:04,757 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-07-20 05:21:04,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:21:04,757 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-07-20 05:21:04,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:04,757 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-07-20 05:21:04,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-20 05:21:04,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:21:04,758 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:21:04,795 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-20 05:21:04,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-20 05:21:04,958 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-20 05:21:04,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:21:04,958 INFO L85 PathProgramCache]: Analyzing trace with hash 217332671, now seen corresponding path program 22 times [2022-07-20 05:21:04,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:21:04,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19410909] [2022-07-20 05:21:04,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:21:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:21:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:21:05,581 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 325 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:05,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:21:05,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19410909] [2022-07-20 05:21:05,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19410909] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:21:05,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [735772140] [2022-07-20 05:21:05,582 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:21:05,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:21:05,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:21:05,583 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-20 05:21:05,584 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-20 05:21:05,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:21:05,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:21:05,826 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 248 conjunts are in the unsatisfiable core [2022-07-20 05:21:05,830 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:21:05,834 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-20 05:21:05,838 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-20 05:21:06,707 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 16 treesize of output 12 [2022-07-20 05:21:06,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:06,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,036 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,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 18 treesize of output 20 [2022-07-20 05:21:07,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,407 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,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 18 treesize of output 20 [2022-07-20 05:21:07,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:07,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 18 treesize of output 20 [2022-07-20 05:21:07,922 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:08,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:08,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:21:08,238 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:21:08,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:21:08,397 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 392 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:08,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:21:11,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) 0) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)))) is different from false [2022-07-20 05:21:11,151 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) is different from false [2022-07-20 05:21:11,156 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:21:11,156 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-20 05:21:11,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:21:11,162 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-20 05:21:11,165 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-20 05:21:13,819 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-20 05:21:13,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [735772140] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:21:13,819 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:21:13,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 52, 52] total 138 [2022-07-20 05:21:13,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140271381] [2022-07-20 05:21:13,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:21:13,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-20 05:21:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:21:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-20 05:21:13,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=16810, Unknown=18, NotChecked=542, Total=19182 [2022-07-20 05:21:13,823 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:18,369 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1))) (and (<= 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= .cse0 .cse1) (<= 15 .cse1) (or (= |c_ULTIMATE.start_cstrncpy_#t~mem5#1| 0) (not (= (+ (- 1) .cse1) (+ (- 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (or (and (<= (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse1) (<= 0 .cse0)) (forall ((v_ArrVal_2102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 15))) is different from false [2022-07-20 05:21:18,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:21:18,662 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-07-20 05:21:18,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-20 05:21:18,663 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 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 130 [2022-07-20 05:21:18,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:21:18,663 INFO L225 Difference]: With dead ends: 139 [2022-07-20 05:21:18,664 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 05:21:18,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 164 SyntacticMatches, 9 SemanticMatches, 189 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6606 ImplicationChecksByTransitivity, 10.7s TimeCoverageRelationStatistics Valid=5185, Invalid=29894, Unknown=89, NotChecked=1122, Total=36290 [2022-07-20 05:21:18,665 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1078 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1846 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:21:18,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1078 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1579 Invalid, 0 Unknown, 1846 Unchecked, 0.5s Time] [2022-07-20 05:21:18,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 05:21:18,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-20 05:21:18,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:18,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-20 05:21:18,668 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 130 [2022-07-20 05:21:18,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:21:18,668 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-20 05:21:18,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:18,669 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-20 05:21:18,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-20 05:21:18,669 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:21:18,669 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:21:18,689 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-20 05:21:18,886 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,SelfDestructingSolverStorable40 [2022-07-20 05:21:18,887 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-20 05:21:18,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:21:18,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1547261425, now seen corresponding path program 23 times [2022-07-20 05:21:18,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:21:18,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818658630] [2022-07-20 05:21:18,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:21:18,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:21:18,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:21:19,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 531 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:19,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:21:19,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818658630] [2022-07-20 05:21:19,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818658630] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:21:19,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654212556] [2022-07-20 05:21:19,516 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:21:19,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:21:19,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:21:19,517 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-20 05:21:19,517 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-20 05:21:26,531 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-20 05:21:26,531 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:21:26,553 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-20 05:21:26,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:21:26,565 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:21:26,565 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-20 05:21:27,997 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:27,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:21:28,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:28,928 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [654212556] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:21:28,928 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:21:28,928 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 91 [2022-07-20 05:21:28,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091712553] [2022-07-20 05:21:28,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:21:28,929 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-20 05:21:28,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:21:28,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-20 05:21:28,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2022-07-20 05:21:28,930 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:29,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:21:29,972 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-20 05:21:29,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 05:21:29,973 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 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 138 [2022-07-20 05:21:29,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:21:29,987 INFO L225 Difference]: With dead ends: 214 [2022-07-20 05:21:29,987 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 05:21:29,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2802, Invalid=12948, Unknown=0, NotChecked=0, Total=15750 [2022-07-20 05:21:29,989 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 146 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:21:29,989 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 267 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:21:29,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 05:21:29,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-07-20 05:21:29,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:29,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-07-20 05:21:29,992 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2022-07-20 05:21:29,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:21:29,992 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-07-20 05:21:29,992 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:21:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-07-20 05:21:29,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-20 05:21:29,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:21:29,993 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:21:30,017 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-20 05:21:30,206 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,SelfDestructingSolverStorable41 [2022-07-20 05:21:30,206 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-20 05:21:30,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:21:30,206 INFO L85 PathProgramCache]: Analyzing trace with hash 524136654, now seen corresponding path program 24 times [2022-07-20 05:21:30,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:21:30,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235713678] [2022-07-20 05:21:30,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:21:30,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:21:30,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:21:31,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:21:31,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:21:31,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235713678] [2022-07-20 05:21:31,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235713678] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:21:31,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1110701655] [2022-07-20 05:21:31,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:21:31,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:21:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:21:31,936 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-20 05:21:31,941 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-20 05:22:11,275 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-20 05:22:11,275 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:22:11,342 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 284 conjunts are in the unsatisfiable core [2022-07-20 05:22:11,346 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:22:11,349 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-20 05:22:12,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, 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-20 05:22:12,633 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:12,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:12,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 16 treesize of output 18 [2022-07-20 05:22:12,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:12,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:22:13,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,591 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,668 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,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-20 05:22:13,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:13,834 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-20 05:22:13,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:13,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:22:13,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:22:13,846 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:22:13,849 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2411) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:22:13,853 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:22:13,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2410 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2410) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,860 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2409) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,869 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2408) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2407) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,882 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2406) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,886 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2405) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2404) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,899 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2403) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,911 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:22:13,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2402) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:22:13,925 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:22:13,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2401) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)))) is different from false [2022-07-20 05:22:13,931 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:22:13,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2400 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2400) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2399) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2398) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:22:13,960 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2397) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:22:13,968 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:22:13,969 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-20 05:22:13,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:22:13,972 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-20 05:22:13,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 11 treesize of output 7 [2022-07-20 05:22:14,321 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 543 not checked. [2022-07-20 05:22:14,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1110701655] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:22:14,321 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:22:14,321 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 57, 57] total 146 [2022-07-20 05:22:14,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635025892] [2022-07-20 05:22:14,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:22:14,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-20 05:22:14,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:22:14,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-20 05:22:14,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12349, Unknown=33, NotChecked=8382, Total=21170 [2022-07-20 05:22:14,324 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:19,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:22:19,186 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-20 05:22:19,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-07-20 05:22:19,186 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 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 142 [2022-07-20 05:22:19,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:22:19,187 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:22:19,187 INFO L226 Difference]: Without dead ends: 150 [2022-07-20 05:22:19,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 205 SyntacticMatches, 51 SemanticMatches, 179 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=614, Invalid=21241, Unknown=33, NotChecked=10692, Total=32580 [2022-07-20 05:22:19,190 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 6045 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 10271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 6045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4163 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:22:19,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2435 Invalid, 10271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 6045 Invalid, 0 Unknown, 4163 Unchecked, 1.5s Time] [2022-07-20 05:22:19,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-20 05:22:19,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-20 05:22:19,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:19,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-07-20 05:22:19,192 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2022-07-20 05:22:19,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:22:19,194 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-07-20 05:22:19,194 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:19,194 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-07-20 05:22:19,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-20 05:22:19,194 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:22:19,195 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:22:19,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-20 05:22:19,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:19,410 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-20 05:22:19,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:22:19,410 INFO L85 PathProgramCache]: Analyzing trace with hash -1062251221, now seen corresponding path program 25 times [2022-07-20 05:22:19,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:22:19,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670943335] [2022-07-20 05:22:19,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:22:19,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:22:19,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:22:20,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:20,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:22:20,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670943335] [2022-07-20 05:22:20,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670943335] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:22:20,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904235866] [2022-07-20 05:22:20,123 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:22:20,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:20,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:22:20,124 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-20 05:22:20,125 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-20 05:22:20,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:22:20,377 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-20 05:22:20,380 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:22:21,007 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:21,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:22:21,828 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-20 05:22:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:21,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904235866] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:22:21,891 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:22:21,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 82 [2022-07-20 05:22:21,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257493896] [2022-07-20 05:22:21,891 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:22:21,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-20 05:22:21,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:22:21,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-20 05:22:21,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=6030, Unknown=0, NotChecked=0, Total=6806 [2022-07-20 05:22:21,892 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:23,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:22:23,455 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2022-07-20 05:22:23,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-20 05:22:23,455 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 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 146 [2022-07-20 05:22:23,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:22:23,456 INFO L225 Difference]: With dead ends: 153 [2022-07-20 05:22:23,456 INFO L226 Difference]: Without dead ends: 153 [2022-07-20 05:22:23,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3186 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2753, Invalid=11767, Unknown=0, NotChecked=0, Total=14520 [2022-07-20 05:22:23,457 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 547 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:22:23,457 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1049 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 05:22:23,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-20 05:22:23,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2022-07-20 05:22:23,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-20 05:22:23,459 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2022-07-20 05:22:23,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:22:23,460 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-20 05:22:23,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:23,460 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-20 05:22:23,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-20 05:22:23,460 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:22:23,460 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:22:23,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:22:23,672 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:23,673 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-20 05:22:23,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:22:23,673 INFO L85 PathProgramCache]: Analyzing trace with hash -2125072764, now seen corresponding path program 26 times [2022-07-20 05:22:23,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:22:23,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764168006] [2022-07-20 05:22:23,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:22:23,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:22:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:22:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 36 proven. 1173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:25,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:22:25,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764168006] [2022-07-20 05:22:25,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764168006] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:22:25,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796586143] [2022-07-20 05:22:25,602 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:22:25,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:25,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:22:25,603 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-20 05:22:25,604 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-20 05:22:25,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:22:25,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:22:25,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 281 conjunts are in the unsatisfiable core [2022-07-20 05:22:25,883 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:22:25,885 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-20 05:22:26,719 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-20 05:22:27,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:27,155 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:27,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 17 treesize of output 19 [2022-07-20 05:22:27,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:27,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:27,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:28,113 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:22:28,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 17 treesize of output 19 [2022-07-20 05:22:28,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:28,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:29,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:29,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 17 treesize of output 19 [2022-07-20 05:22:29,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:22:29,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-20 05:22:30,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:30,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:30,578 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:22:30,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:22:30,785 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-20 05:22:31,002 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 496 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:31,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:22:35,570 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| Int)) (or (<= (+ 19 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2736) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| 17)) 0))) is different from false [2022-07-20 05:22:35,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2736) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| 17)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|)) (<= (+ 19 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-20 05:22:35,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:22:35,584 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-20 05:22:35,589 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:22:35,589 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-20 05:22:35,594 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-20 05:22:35,596 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-20 05:22:37,727 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 496 proven. 695 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-07-20 05:22:37,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796586143] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:22:37,727 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:22:37,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 60, 60] total 195 [2022-07-20 05:22:37,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321652288] [2022-07-20 05:22:37,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:22:37,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 195 states [2022-07-20 05:22:37,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:22:37,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2022-07-20 05:22:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1995, Invalid=35051, Unknown=18, NotChecked=766, Total=37830 [2022-07-20 05:22:37,730 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 195 states, 195 states have (on average 2.2666666666666666) internal successors, (442), 195 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:53,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:22:53,969 INFO L93 Difference]: Finished difference Result 238 states and 239 transitions. [2022-07-20 05:22:53,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2022-07-20 05:22:53,978 INFO L78 Accepts]: Start accepts. Automaton has has 195 states, 195 states have (on average 2.2666666666666666) internal successors, (442), 195 states have internal predecessors, (442), 0 states have call successors, (0), 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 150 [2022-07-20 05:22:53,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:22:53,978 INFO L225 Difference]: With dead ends: 238 [2022-07-20 05:22:53,978 INFO L226 Difference]: Without dead ends: 164 [2022-07-20 05:22:53,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 469 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 270 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 15184 ImplicationChecksByTransitivity, 27.5s TimeCoverageRelationStatistics Valid=4132, Invalid=68488, Unknown=18, NotChecked=1074, Total=73712 [2022-07-20 05:22:53,995 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 254 mSDsluCounter, 2304 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 2345 SdHoareTripleChecker+Invalid, 3964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1719 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:22:53,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 2345 Invalid, 3964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2225 Invalid, 0 Unknown, 1719 Unchecked, 0.6s Time] [2022-07-20 05:22:53,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-20 05:22:53,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 159. [2022-07-20 05:22:53,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 158 states have (on average 1.0126582278481013) internal successors, (160), 158 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:53,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-07-20 05:22:53,998 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 150 [2022-07-20 05:22:53,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:22:53,999 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-07-20 05:22:53,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 195 states, 195 states have (on average 2.2666666666666666) internal successors, (442), 195 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:22:53,999 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-07-20 05:22:53,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-20 05:22:53,999 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:22:54,000 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:22:54,025 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-20 05:22:54,200 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:54,200 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-20 05:22:54,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:22:54,201 INFO L85 PathProgramCache]: Analyzing trace with hash -161528774, now seen corresponding path program 27 times [2022-07-20 05:22:54,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:22:54,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196573588] [2022-07-20 05:22:54,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:22:54,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:22:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:22:56,595 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 38 proven. 1314 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:22:56,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:22:56,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196573588] [2022-07-20 05:22:56,595 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196573588] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:22:56,595 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883634332] [2022-07-20 05:22:56,595 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:22:56,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:22:56,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:22:56,597 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-20 05:22:56,597 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-20 05:23:12,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-07-20 05:23:12,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:12,618 INFO L263 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 310 conjunts are in the unsatisfiable core [2022-07-20 05:23:12,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:12,625 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-20 05:23:13,488 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-20 05:23:13,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:13,755 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:13,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:13,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:13,917 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:13,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,028 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,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-20 05:23:14,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:23:14,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-20 05:23:14,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:23:14,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:23:14,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,616 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-20 05:23:14,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 14 treesize of output 16 [2022-07-20 05:23:14,628 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-20 05:23:14,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 38 proven. 1314 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:14,631 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:14,636 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-20 05:23:14,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:23:14,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2919 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2919) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-20 05:23:14,646 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2918 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2918) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,652 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,655 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2917 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2917) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2916) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,666 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,683 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2915 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2914 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2914) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2913 (Array Int Int)) (v_ArrVal_2920 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2913) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2912 (Array Int Int)) (v_ArrVal_2920 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2912) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,709 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2911 (Array Int Int)) (v_ArrVal_2920 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2911) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:23:14,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2910 (Array Int Int)) (v_ArrVal_2920 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2910) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:23:14,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:23:14,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2909 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2909) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-20 05:23:14,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2908 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2908) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,731 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2907 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2907) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,738 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2906 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2906) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-20 05:23:14,744 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,747 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2905 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2905) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2904 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2904) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,759 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 17 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,762 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int)) (v_ArrVal_2903 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2903) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 17 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 18 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,768 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2920 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2920) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:14,770 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:14,770 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-20 05:23:14,774 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:14,775 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-20 05:23:14,776 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-20 05:23:15,414 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 38 proven. 631 refuted. 0 times theorem prover too weak. 0 trivial. 683 not checked. [2022-07-20 05:23:15,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883634332] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:15,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:15,415 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [81, 63, 63] total 160 [2022-07-20 05:23:15,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982646903] [2022-07-20 05:23:15,415 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:15,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 160 states [2022-07-20 05:23:15,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:15,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2022-07-20 05:23:15,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=14675, Unknown=37, NotChecked=10286, Total=25440 [2022-07-20 05:23:15,417 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 160 states, 160 states have (on average 2.28125) internal successors, (365), 160 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:20,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:20,717 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-07-20 05:23:20,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2022-07-20 05:23:20,717 INFO L78 Accepts]: Start accepts. Automaton has has 160 states, 160 states have (on average 2.28125) internal successors, (365), 160 states have internal predecessors, (365), 0 states have call successors, (0), 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 158 [2022-07-20 05:23:20,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:20,718 INFO L225 Difference]: With dead ends: 244 [2022-07-20 05:23:20,718 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 05:23:20,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 468 GetRequests, 224 SyntacticMatches, 48 SemanticMatches, 196 ConstructedPredicates, 37 IntricatePredicates, 0 DeprecatedPredicates, 7277 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=662, Invalid=25209, Unknown=37, NotChecked=13098, Total=39006 [2022-07-20 05:23:20,720 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 82 mSDsluCounter, 2749 mSDsCounter, 0 mSdLazyCounter, 7856 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2791 SdHoareTripleChecker+Invalid, 13930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 7856 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5987 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:20,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2791 Invalid, 13930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 7856 Invalid, 0 Unknown, 5987 Unchecked, 1.9s Time] [2022-07-20 05:23:20,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 05:23:20,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-07-20 05:23:20,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 162 states have (on average 1.0123456790123457) internal successors, (164), 162 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:20,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 164 transitions. [2022-07-20 05:23:20,722 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 164 transitions. Word has length 158 [2022-07-20 05:23:20,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:20,722 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 164 transitions. [2022-07-20 05:23:20,723 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 160 states, 160 states have (on average 2.28125) internal successors, (365), 160 states have internal predecessors, (365), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:20,723 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 164 transitions. [2022-07-20 05:23:20,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 05:23:20,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:20,723 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:20,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-07-20 05:23:20,944 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,SelfDestructingSolverStorable45 [2022-07-20 05:23:20,944 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-20 05:23:20,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash -1245802857, now seen corresponding path program 28 times [2022-07-20 05:23:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:20,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17389235] [2022-07-20 05:23:20,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:20,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:20,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:21,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 561 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:21,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17389235] [2022-07-20 05:23:21,860 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17389235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:21,860 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1737115466] [2022-07-20 05:23:21,860 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:23:21,860 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:21,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:21,861 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-20 05:23:21,863 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-20 05:23:22,176 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:23:22,176 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:22,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 302 conjunts are in the unsatisfiable core [2022-07-20 05:23:22,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:22,196 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:22,196 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-20 05:23:22,200 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-20 05:23:23,255 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 16 treesize of output 12 [2022-07-20 05:23:23,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 18 treesize of output 20 [2022-07-20 05:23:23,604 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:23,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:23,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:23,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,503 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,620 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,770 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:24,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:25,070 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:25,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:25,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 18 treesize of output 20 [2022-07-20 05:23:25,468 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:25,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:25,741 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:25,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 05:23:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 648 proven. 777 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:25,964 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:30,712 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654| Int) (v_ArrVal_3109 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 20 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_3109) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 18 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|)) 0))) is different from false [2022-07-20 05:23:30,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654| Int) (v_ArrVal_3109 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|) (<= (+ 20 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|) (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_3109) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_654|)) 0))) is different from false [2022-07-20 05:23:30,729 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:30,729 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-20 05:23:30,734 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:30,734 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-20 05:23:30,738 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-20 05:23:34,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 703 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 19 not checked. [2022-07-20 05:23:34,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1737115466] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:34,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:34,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 64, 64] total 170 [2022-07-20 05:23:34,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941571437] [2022-07-20 05:23:34,655 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:34,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 171 states [2022-07-20 05:23:34,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:34,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2022-07-20 05:23:34,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2739, Invalid=25642, Unknown=19, NotChecked=670, Total=29070 [2022-07-20 05:23:34,657 INFO L87 Difference]: Start difference. First operand 163 states and 164 transitions. Second operand has 171 states, 170 states have (on average 2.8117647058823527) internal successors, (478), 171 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)