./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 06:06:35,007 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 06:06:35,009 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 06:06:35,035 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 06:06:35,036 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 06:06:35,037 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 06:06:35,042 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 06:06:35,051 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 06:06:35,052 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 06:06:35,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 06:06:35,053 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 06:06:35,054 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 06:06:35,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 06:06:35,060 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 06:06:35,061 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 06:06:35,062 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 06:06:35,064 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 06:06:35,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 06:06:35,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 06:06:35,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 06:06:35,073 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 06:06:35,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 06:06:35,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 06:06:35,080 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 06:06:35,080 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 06:06:35,082 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 06:06:35,084 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 06:06:35,084 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 06:06:35,085 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 06:06:35,086 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 06:06:35,087 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 06:06:35,087 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 06:06:35,088 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 06:06:35,089 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 06:06:35,090 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 06:06:35,091 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 06:06:35,091 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 06:06:35,092 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 06:06:35,092 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 06:06:35,092 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 06:06:35,093 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 06:06:35,094 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 06:06:35,096 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-14 06:06:35,120 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 06:06:35,121 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 06:06:35,121 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 06:06:35,121 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 06:06:35,122 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 06:06:35,122 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 06:06:35,123 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 06:06:35,123 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 06:06:35,123 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 06:06:35,123 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 06:06:35,123 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-14 06:06:35,124 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-14 06:06:35,124 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 06:06:35,124 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-14 06:06:35,124 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 06:06:35,124 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-14 06:06:35,125 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 06:06:35,126 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 06:06:35,126 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 06:06:35,126 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 06:06:35,126 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:06:35,127 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 06:06:35,127 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 06:06:35,127 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 06:06:35,127 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 06:06:35,127 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2022-07-14 06:06:35,349 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 06:06:35,375 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 06:06:35,377 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 06:06:35,378 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 06:06:35,387 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 06:06:35,389 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-14 06:06:35,463 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611057455/4f62f65f67b3446ea6a0f785703b017d/FLAGbc46eea1e [2022-07-14 06:06:35,855 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 06:06:35,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-14 06:06:35,862 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611057455/4f62f65f67b3446ea6a0f785703b017d/FLAGbc46eea1e [2022-07-14 06:06:35,872 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/611057455/4f62f65f67b3446ea6a0f785703b017d [2022-07-14 06:06:35,874 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 06:06:35,875 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 06:06:35,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 06:06:35,877 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 06:06:35,879 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 06:06:35,879 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:06:35" (1/1) ... [2022-07-14 06:06:35,880 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b8bed15 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:35, skipping insertion in model container [2022-07-14 06:06:35,880 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 06:06:35" (1/1) ... [2022-07-14 06:06:35,885 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 06:06:35,908 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 06:06:36,091 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:06:36,112 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 06:06:36,153 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 06:06:36,174 INFO L208 MainTranslator]: Completed translation [2022-07-14 06:06:36,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36 WrapperNode [2022-07-14 06:06:36,174 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 06:06:36,175 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 06:06:36,175 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 06:06:36,177 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 06:06:36,183 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,196 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,212 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-07-14 06:06:36,212 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 06:06:36,213 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 06:06:36,213 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 06:06:36,213 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 06:06:36,218 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,219 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,220 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,221 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,224 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,227 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,228 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 06:06:36,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 06:06:36,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 06:06:36,230 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 06:06:36,231 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (1/1) ... [2022-07-14 06:06:36,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 06:06:36,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:36,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 06:06:36,299 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 06:06:36,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 06:06:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 06:06:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 06:06:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 06:06:36,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 06:06:36,326 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 06:06:36,399 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 06:06:36,401 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 06:06:36,557 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 06:06:36,562 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 06:06:36,562 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-14 06:06:36,564 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:06:36 BoogieIcfgContainer [2022-07-14 06:06:36,564 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 06:06:36,566 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 06:06:36,566 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 06:06:36,569 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 06:06:36,569 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 06:06:35" (1/3) ... [2022-07-14 06:06:36,570 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6822021d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:06:36, skipping insertion in model container [2022-07-14 06:06:36,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 06:06:36" (2/3) ... [2022-07-14 06:06:36,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6822021d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 06:06:36, skipping insertion in model container [2022-07-14 06:06:36,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 06:06:36" (3/3) ... [2022-07-14 06:06:36,572 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2022-07-14 06:06:36,582 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 06:06:36,582 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-14 06:06:36,612 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 06:06:36,617 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@14d0e34b, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@154d75ee [2022-07-14 06:06:36,617 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-14 06:06:36,620 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:06:36,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:36,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:36,625 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-14 06:06:36,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:36,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-14 06:06:36,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:36,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [475006605] [2022-07-14 06:06:36,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:36,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:36,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:36,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:36,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [475006605] [2022-07-14 06:06:36,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [475006605] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:36,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:36,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-14 06:06:36,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023217180] [2022-07-14 06:06:36,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:36,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 06:06:36,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:36,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 06:06:36,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:06:36,791 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:36,820 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-14 06:06:36,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 06:06:36,822 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-14 06:06:36,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:36,827 INFO L225 Difference]: With dead ends: 36 [2022-07-14 06:06:36,827 INFO L226 Difference]: Without dead ends: 34 [2022-07-14 06:06:36,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-14 06:06:36,833 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:36,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:36,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-14 06:06:36,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-14 06:06:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-14 06:06:36,857 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2022-07-14 06:06:36,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:36,858 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-14 06:06:36,858 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-14 06:06:36,859 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-14 06:06:36,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:06:36,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:36,859 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:36,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 06:06:36,860 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-14 06:06:36,861 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:36,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-14 06:06:36,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:36,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395461700] [2022-07-14 06:06:36,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:36,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:36,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:36,938 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:36,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:36,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395461700] [2022-07-14 06:06:36,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395461700] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:36,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:36,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:06:36,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1467802931] [2022-07-14 06:06:36,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:36,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:06:36,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:36,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:06:36,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:06:36,943 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:36,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:36,973 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-14 06:06:36,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:06:36,973 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-14 06:06:36,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:36,975 INFO L225 Difference]: With dead ends: 33 [2022-07-14 06:06:36,975 INFO L226 Difference]: Without dead ends: 33 [2022-07-14 06:06:36,978 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-14 06:06:36,980 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:36,981 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:36,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-14 06:06:36,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-14 06:06:36,986 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-14 06:06:36,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-14 06:06:36,987 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-14 06:06:36,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:36,987 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-14 06:06:36,988 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-14 06:06:36,988 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-14 06:06:36,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:06:36,988 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:36,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:36,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 06:06:36,989 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-14 06:06:36,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:36,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-14 06:06:36,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:36,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657007118] [2022-07-14 06:06:36,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:36,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,041 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:37,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:37,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657007118] [2022-07-14 06:06:37,042 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657007118] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:37,042 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:37,042 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:06:37,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173609480] [2022-07-14 06:06:37,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:37,042 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:06:37,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:37,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:06:37,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:06:37,051 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:37,074 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-14 06:06:37,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:06:37,074 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-14 06:06:37,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:37,075 INFO L225 Difference]: With dead ends: 59 [2022-07-14 06:06:37,076 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 06:06:37,076 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-14 06:06:37,077 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:37,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:37,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 06:06:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-07-14 06:06:37,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-14 06:06:37,084 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2022-07-14 06:06:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:37,085 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-14 06:06:37,085 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-14 06:06:37,085 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-14 06:06:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-14 06:06:37,085 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:37,085 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:37,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 06:06:37,086 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-14 06:06:37,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:37,087 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-14 06:06:37,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:37,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369987941] [2022-07-14 06:06:37,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:37,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:37,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:37,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369987941] [2022-07-14 06:06:37,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369987941] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:37,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:37,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:06:37,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172467350] [2022-07-14 06:06:37,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:37,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:06:37,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:37,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:06:37,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:37,166 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:37,212 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-14 06:06:37,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:06:37,212 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-14 06:06:37,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:37,213 INFO L225 Difference]: With dead ends: 63 [2022-07-14 06:06:37,213 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:06:37,213 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:37,214 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:37,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:06:37,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2022-07-14 06:06:37,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-14 06:06:37,217 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 7 [2022-07-14 06:06:37,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:37,217 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-14 06:06:37,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,218 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-14 06:06:37,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:06:37,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:37,218 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:37,218 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 06:06:37,218 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:37,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751785, now seen corresponding path program 1 times [2022-07-14 06:06:37,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:37,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922370326] [2022-07-14 06:06:37,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:37,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,261 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:37,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:37,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922370326] [2022-07-14 06:06:37,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922370326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:37,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:37,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:06:37,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417954283] [2022-07-14 06:06:37,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:37,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 06:06:37,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:37,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 06:06:37,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:06:37,263 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:37,310 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-14 06:06:37,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:06:37,311 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-14 06:06:37,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:37,311 INFO L225 Difference]: With dead ends: 39 [2022-07-14 06:06:37,311 INFO L226 Difference]: Without dead ends: 39 [2022-07-14 06:06:37,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:06:37,312 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:37,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:37,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-14 06:06:37,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-14 06:06:37,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-14 06:06:37,315 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2022-07-14 06:06:37,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:37,316 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-14 06:06:37,316 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-14 06:06:37,316 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-14 06:06:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:06:37,316 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:37,317 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:37,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 06:06:37,317 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751784, now seen corresponding path program 1 times [2022-07-14 06:06:37,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:37,318 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991340560] [2022-07-14 06:06:37,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:37,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:37,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:37,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991340560] [2022-07-14 06:06:37,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991340560] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:37,395 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:37,395 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 06:06:37,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603189152] [2022-07-14 06:06:37,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:37,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 06:06:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:37,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 06:06:37,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 06:06:37,397 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:37,480 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-14 06:06:37,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:06:37,482 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:06:37,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:37,484 INFO L225 Difference]: With dead ends: 43 [2022-07-14 06:06:37,484 INFO L226 Difference]: Without dead ends: 43 [2022-07-14 06:06:37,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-14 06:06:37,486 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:37,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-14 06:06:37,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-14 06:06:37,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-14 06:06:37,498 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-07-14 06:06:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:37,498 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-14 06:06:37,498 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-14 06:06:37,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-14 06:06:37,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:37,498 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:37,498 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 06:06:37,498 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:37,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:37,499 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-14 06:06:37,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:37,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415503512] [2022-07-14 06:06:37,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:37,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:37,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,576 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-14 06:06:37,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:37,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415503512] [2022-07-14 06:06:37,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415503512] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:37,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53256949] [2022-07-14 06:06:37,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:37,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:37,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:37,578 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:37,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 06:06:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:37,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-14 06:06:37,641 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:37,722 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:06:37,722 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-14 06:06:37,796 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-14 06:06:37,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:37,929 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-14 06:06:37,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53256949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:37,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:37,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-14 06:06:37,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934076381] [2022-07-14 06:06:37,930 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:37,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:06:37,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:37,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:06:37,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:06:37,931 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,036 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-14 06:06:38,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:06:38,037 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-14 06:06:38,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,037 INFO L225 Difference]: With dead ends: 89 [2022-07-14 06:06:38,037 INFO L226 Difference]: Without dead ends: 89 [2022-07-14 06:06:38,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-14 06:06:38,038 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 201 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:06:38,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-14 06:06:38,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-07-14 06:06:38,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-14 06:06:38,041 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2022-07-14 06:06:38,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,041 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-14 06:06:38,042 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,042 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-14 06:06:38,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:06:38,042 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,042 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:38,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:38,256 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,256 INFO L85 PathProgramCache]: Analyzing trace with hash -466410634, now seen corresponding path program 1 times [2022-07-14 06:06:38,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953342450] [2022-07-14 06:06:38,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953342450] [2022-07-14 06:06:38,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953342450] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,303 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:06:38,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654376449] [2022-07-14 06:06:38,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:06:38,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:06:38,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:06:38,304 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,322 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-14 06:06:38,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:06:38,322 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-14 06:06:38,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,323 INFO L225 Difference]: With dead ends: 73 [2022-07-14 06:06:38,323 INFO L226 Difference]: Without dead ends: 73 [2022-07-14 06:06:38,323 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-14 06:06:38,324 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,325 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-14 06:06:38,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-14 06:06:38,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.35) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-14 06:06:38,335 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-14 06:06:38,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,335 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-14 06:06:38,335 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-14 06:06:38,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-14 06:06:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:06:38,336 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,336 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 06:06:38,337 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,337 INFO L85 PathProgramCache]: Analyzing trace with hash -467763174, now seen corresponding path program 1 times [2022-07-14 06:06:38,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102049534] [2022-07-14 06:06:38,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102049534] [2022-07-14 06:06:38,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102049534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,410 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:06:38,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548487749] [2022-07-14 06:06:38,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,411 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:06:38,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:06:38,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:06:38,412 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,455 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-14 06:06:38,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:06:38,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:06:38,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,456 INFO L225 Difference]: With dead ends: 47 [2022-07-14 06:06:38,456 INFO L226 Difference]: Without dead ends: 47 [2022-07-14 06:06:38,456 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:06:38,457 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-14 06:06:38,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-14 06:06:38,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-14 06:06:38,464 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2022-07-14 06:06:38,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,464 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-14 06:06:38,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,464 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-14 06:06:38,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:06:38,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 06:06:38,466 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,466 INFO L85 PathProgramCache]: Analyzing trace with hash -467763173, now seen corresponding path program 1 times [2022-07-14 06:06:38,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199098626] [2022-07-14 06:06:38,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,542 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199098626] [2022-07-14 06:06:38,543 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199098626] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,543 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,543 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 06:06:38,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014127396] [2022-07-14 06:06:38,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,544 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 06:06:38,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 06:06:38,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:06:38,545 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,619 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-14 06:06:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 06:06:38,620 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:06:38,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,620 INFO L225 Difference]: With dead ends: 47 [2022-07-14 06:06:38,620 INFO L226 Difference]: Without dead ends: 47 [2022-07-14 06:06:38,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-14 06:06:38,621 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-14 06:06:38,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-14 06:06:38,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-14 06:06:38,633 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-14 06:06:38,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,633 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-14 06:06:38,633 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,633 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-14 06:06:38,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-14 06:06:38,634 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,634 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 06:06:38,635 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,635 INFO L85 PathProgramCache]: Analyzing trace with hash 213647736, now seen corresponding path program 1 times [2022-07-14 06:06:38,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819236863] [2022-07-14 06:06:38,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,680 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819236863] [2022-07-14 06:06:38,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819236863] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,681 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,681 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:06:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133732114] [2022-07-14 06:06:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:06:38,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:06:38,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:38,682 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,697 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-14 06:06:38,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:06:38,698 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-14 06:06:38,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,698 INFO L225 Difference]: With dead ends: 49 [2022-07-14 06:06:38,698 INFO L226 Difference]: Without dead ends: 49 [2022-07-14 06:06:38,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-14 06:06:38,699 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-14 06:06:38,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-14 06:06:38,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-14 06:06:38,701 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2022-07-14 06:06:38,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,701 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-14 06:06:38,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-14 06:06:38,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:06:38,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,701 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 06:06:38,702 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,702 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901600, now seen corresponding path program 1 times [2022-07-14 06:06:38,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498709604] [2022-07-14 06:06:38,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498709604] [2022-07-14 06:06:38,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498709604] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-14 06:06:38,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310452401] [2022-07-14 06:06:38,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,725 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:06:38,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:06:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:38,726 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,753 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-14 06:06:38,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 06:06:38,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:06:38,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,753 INFO L225 Difference]: With dead ends: 35 [2022-07-14 06:06:38,753 INFO L226 Difference]: Without dead ends: 35 [2022-07-14 06:06:38,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:06:38,754 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-14 06:06:38,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-14 06:06:38,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-14 06:06:38,756 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2022-07-14 06:06:38,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,756 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-14 06:06:38,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,756 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-14 06:06:38,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:06:38,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,757 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,757 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 06:06:38,757 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901599, now seen corresponding path program 1 times [2022-07-14 06:06:38,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,758 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113888402] [2022-07-14 06:06:38,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113888402] [2022-07-14 06:06:38,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113888402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:06:38,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585246172] [2022-07-14 06:06:38,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:06:38,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:06:38,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:38,800 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:38,826 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-14 06:06:38,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:06:38,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:06:38,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:38,827 INFO L225 Difference]: With dead ends: 69 [2022-07-14 06:06:38,828 INFO L226 Difference]: Without dead ends: 69 [2022-07-14 06:06:38,828 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:06:38,828 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:38,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:38,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-14 06:06:38,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-14 06:06:38,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-14 06:06:38,830 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2022-07-14 06:06:38,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:38,830 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-14 06:06:38,831 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:38,831 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-14 06:06:38,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-14 06:06:38,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:38,831 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:38,831 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 06:06:38,832 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1889707613, now seen corresponding path program 1 times [2022-07-14 06:06:38,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:38,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467002022] [2022-07-14 06:06:38,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:38,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:38,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:38,941 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:38,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:38,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467002022] [2022-07-14 06:06:38,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467002022] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:38,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:38,942 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:06:38,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24845383] [2022-07-14 06:06:38,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:38,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:06:38,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:38,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:06:38,943 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:06:38,943 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:39,081 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-14 06:06:39,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:06:39,081 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-14 06:06:39,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:39,083 INFO L225 Difference]: With dead ends: 57 [2022-07-14 06:06:39,083 INFO L226 Difference]: Without dead ends: 57 [2022-07-14 06:06:39,083 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:06:39,084 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:39,084 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:39,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-14 06:06:39,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-14 06:06:39,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-14 06:06:39,086 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2022-07-14 06:06:39,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:39,087 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-14 06:06:39,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,087 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-14 06:06:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:06:39,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:39,089 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:39,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 06:06:39,090 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:39,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:39,090 INFO L85 PathProgramCache]: Analyzing trace with hash -1717205610, now seen corresponding path program 1 times [2022-07-14 06:06:39,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:39,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140136652] [2022-07-14 06:06:39,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:39,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,150 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-14 06:06:39,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:39,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140136652] [2022-07-14 06:06:39,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140136652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:39,151 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:39,151 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-14 06:06:39,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080924252] [2022-07-14 06:06:39,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:39,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-14 06:06:39,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:39,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-14 06:06:39,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-14 06:06:39,154 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:39,181 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-14 06:06:39,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-14 06:06:39,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:06:39,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:39,182 INFO L225 Difference]: With dead ends: 61 [2022-07-14 06:06:39,182 INFO L226 Difference]: Without dead ends: 61 [2022-07-14 06:06:39,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-14 06:06:39,185 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:39,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:39,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-14 06:06:39,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-07-14 06:06:39,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-07-14 06:06:39,188 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2022-07-14 06:06:39,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:39,188 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-07-14 06:06:39,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,188 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-07-14 06:06:39,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:06:39,190 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:39,190 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:39,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 06:06:39,190 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:39,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:39,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1566644436, now seen corresponding path program 1 times [2022-07-14 06:06:39,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:39,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858897647] [2022-07-14 06:06:39,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:39,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,285 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-14 06:06:39,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:39,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858897647] [2022-07-14 06:06:39,285 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858897647] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:39,285 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:39,285 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 06:06:39,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752356900] [2022-07-14 06:06:39,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:39,286 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 06:06:39,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:39,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 06:06:39,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 06:06:39,287 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:39,410 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-07-14 06:06:39,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 06:06:39,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:06:39,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:39,411 INFO L225 Difference]: With dead ends: 85 [2022-07-14 06:06:39,411 INFO L226 Difference]: Without dead ends: 85 [2022-07-14 06:06:39,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-14 06:06:39,412 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:39,412 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:39,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-14 06:06:39,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2022-07-14 06:06:39,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.208955223880597) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-14 06:06:39,415 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 17 [2022-07-14 06:06:39,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:39,415 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-14 06:06:39,416 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,416 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-14 06:06:39,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-14 06:06:39,416 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:39,417 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:39,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 06:06:39,417 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:39,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:39,418 INFO L85 PathProgramCache]: Analyzing trace with hash 286780758, now seen corresponding path program 1 times [2022-07-14 06:06:39,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:39,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564051402] [2022-07-14 06:06:39,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,418 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,516 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-14 06:06:39,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:39,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564051402] [2022-07-14 06:06:39,517 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564051402] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:39,517 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:39,517 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 06:06:39,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823120123] [2022-07-14 06:06:39,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:39,518 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 06:06:39,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:39,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 06:06:39,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-14 06:06:39,519 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:39,641 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-14 06:06:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 06:06:39,641 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-14 06:06:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:39,642 INFO L225 Difference]: With dead ends: 107 [2022-07-14 06:06:39,642 INFO L226 Difference]: Without dead ends: 107 [2022-07-14 06:06:39,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-14 06:06:39,642 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:39,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:06:39,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-14 06:06:39,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2022-07-14 06:06:39,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-07-14 06:06:39,645 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-07-14 06:06:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:39,645 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-07-14 06:06:39,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-07-14 06:06:39,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-14 06:06:39,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:39,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:39,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 06:06:39,646 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:39,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:39,647 INFO L85 PathProgramCache]: Analyzing trace with hash 2041976217, now seen corresponding path program 1 times [2022-07-14 06:06:39,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:39,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537592878] [2022-07-14 06:06:39,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:39,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:39,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537592878] [2022-07-14 06:06:39,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537592878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 06:06:39,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 06:06:39,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-14 06:06:39,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85277232] [2022-07-14 06:06:39,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 06:06:39,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-14 06:06:39,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:39,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-14 06:06:39,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-14 06:06:39,691 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:39,700 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-14 06:06:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-14 06:06:39,701 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-14 06:06:39,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:39,701 INFO L225 Difference]: With dead ends: 72 [2022-07-14 06:06:39,701 INFO L226 Difference]: Without dead ends: 43 [2022-07-14 06:06:39,701 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-14 06:06:39,702 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:39,702 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 06:06:39,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-14 06:06:39,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-14 06:06:39,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-14 06:06:39,703 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-07-14 06:06:39,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:39,703 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-14 06:06:39,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:39,704 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-14 06:06:39,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-14 06:06:39,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:39,704 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:39,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 06:06:39,704 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-14 06:06:39,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:39,705 INFO L85 PathProgramCache]: Analyzing trace with hash -2012971173, now seen corresponding path program 1 times [2022-07-14 06:06:39,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:39,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782393321] [2022-07-14 06:06:39,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:39,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,886 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-14 06:06:39,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:39,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782393321] [2022-07-14 06:06:39,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782393321] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:39,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228481950] [2022-07-14 06:06:39,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:39,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:39,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:39,888 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:39,889 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 06:06:39,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:39,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:06:39,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:39,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:39,973 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-14 06:06:39,977 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-14 06:06:40,205 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-14 06:06:40,206 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:40,547 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-14 06:06:40,548 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228481950] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:40,548 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:40,548 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-14 06:06:40,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645079737] [2022-07-14 06:06:40,548 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:40,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:06:40,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:40,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:06:40,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:06:40,549 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:41,711 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-14 06:06:41,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-14 06:06:41,712 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-14 06:06:41,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:41,712 INFO L225 Difference]: With dead ends: 84 [2022-07-14 06:06:41,712 INFO L226 Difference]: Without dead ends: 61 [2022-07-14 06:06:41,713 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=432, Invalid=2648, Unknown=0, NotChecked=0, Total=3080 [2022-07-14 06:06:41,714 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:41,714 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:06:41,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-14 06:06:41,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-14 06:06:41,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:41,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-14 06:06:41,715 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2022-07-14 06:06:41,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:41,715 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-14 06:06:41,715 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:41,715 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-14 06:06:41,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-14 06:06:41,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:41,716 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:41,735 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:41,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:41,927 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:41,928 INFO L85 PathProgramCache]: Analyzing trace with hash -718716967, now seen corresponding path program 1 times [2022-07-14 06:06:41,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:41,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345800765] [2022-07-14 06:06:41,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:41,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:41,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:42,055 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-14 06:06:42,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:42,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345800765] [2022-07-14 06:06:42,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345800765] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:42,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430530448] [2022-07-14 06:06:42,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:42,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:42,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:42,057 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:42,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 06:06:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:42,113 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 06:06:42,114 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:42,226 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-14 06:06:42,226 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:42,358 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-14 06:06:42,375 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-14 06:06:42,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430530448] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:42,375 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:42,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-07-14 06:06:42,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073977002] [2022-07-14 06:06:42,375 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:42,376 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-14 06:06:42,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:42,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-14 06:06:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-07-14 06:06:42,376 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:42,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:42,597 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-07-14 06:06:42,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 06:06:42,598 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-14 06:06:42,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:42,598 INFO L225 Difference]: With dead ends: 56 [2022-07-14 06:06:42,598 INFO L226 Difference]: Without dead ends: 56 [2022-07-14 06:06:42,599 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-07-14 06:06:42,599 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:42,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:06:42,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-14 06:06:42,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-14 06:06:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:42,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-14 06:06:42,600 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2022-07-14 06:06:42,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:42,601 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-14 06:06:42,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:42,601 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-14 06:06:42,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-14 06:06:42,601 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:42,601 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:42,633 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:42,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:42,802 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:42,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:42,802 INFO L85 PathProgramCache]: Analyzing trace with hash -805389510, now seen corresponding path program 1 times [2022-07-14 06:06:42,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:42,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201044468] [2022-07-14 06:06:42,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:42,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:42,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:42,966 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-14 06:06:42,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201044468] [2022-07-14 06:06:42,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201044468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:42,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2136169079] [2022-07-14 06:06:42,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:42,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:42,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:42,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:43,051 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-14 06:06:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:43,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-14 06:06:43,123 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:43,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:43,151 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-14 06:06:43,155 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-14 06:06:43,399 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-14 06:06:43,400 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:43,664 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:06:43,692 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-14 06:06:43,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2136169079] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:43,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:43,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-14 06:06:43,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995640838] [2022-07-14 06:06:43,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:43,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-14 06:06:43,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:43,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-14 06:06:43,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-07-14 06:06:43,694 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:43,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:43,982 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-14 06:06:43,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 06:06:43,983 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-14 06:06:43,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:43,983 INFO L225 Difference]: With dead ends: 52 [2022-07-14 06:06:43,983 INFO L226 Difference]: Without dead ends: 52 [2022-07-14 06:06:43,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:06:43,985 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:43,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-14 06:06:43,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-14 06:06:43,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-14 06:06:43,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:43,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-14 06:06:43,986 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-07-14 06:06:43,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:43,987 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-14 06:06:43,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-14 06:06:43,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-14 06:06:43,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:43,987 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:44,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:44,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:44,188 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:44,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:44,188 INFO L85 PathProgramCache]: Analyzing trace with hash -279519168, now seen corresponding path program 1 times [2022-07-14 06:06:44,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:44,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257323956] [2022-07-14 06:06:44,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:44,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:44,383 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:06:44,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:44,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257323956] [2022-07-14 06:06:44,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257323956] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:44,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414600663] [2022-07-14 06:06:44,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:44,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:44,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:44,396 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:44,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-14 06:06:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:44,513 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:06:44,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:44,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:44,522 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-14 06:06:44,524 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-14 06:06:44,727 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:06:44,727 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:45,057 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-14 06:06:45,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414600663] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:45,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:45,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-14 06:06:45,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284900352] [2022-07-14 06:06:45,057 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:45,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-14 06:06:45,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:45,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-14 06:06:45,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-07-14 06:06:45,058 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:45,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:45,759 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-07-14 06:06:45,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-14 06:06:45,760 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-14 06:06:45,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:45,761 INFO L225 Difference]: With dead ends: 51 [2022-07-14 06:06:45,761 INFO L226 Difference]: Without dead ends: 37 [2022-07-14 06:06:45,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2022-07-14 06:06:45,762 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:45,762 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:06:45,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-14 06:06:45,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-14 06:06:45,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:45,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-14 06:06:45,763 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-14 06:06:45,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:45,763 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-14 06:06:45,763 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:45,764 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-14 06:06:45,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-14 06:06:45,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:45,764 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:45,781 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-14 06:06:45,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-14 06:06:45,980 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-14 06:06:45,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:45,980 INFO L85 PathProgramCache]: Analyzing trace with hash -57121321, now seen corresponding path program 2 times [2022-07-14 06:06:45,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:45,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639516235] [2022-07-14 06:06:45,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:45,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:45,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:46,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:46,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:46,183 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639516235] [2022-07-14 06:06:46,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639516235] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:46,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1455504580] [2022-07-14 06:06:46,184 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:06:46,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:46,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:46,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:46,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-14 06:06:46,274 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:06:46,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:06:46,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-14 06:06:46,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:46,282 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-14 06:06:46,314 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-14 06:06:46,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:06:46,621 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:46,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 06:06:46,725 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:46,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:46,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:06:46,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)))) is different from false [2022-07-14 06:06:46,996 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-14 06:06:47,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:47,005 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-14 06:06:47,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:47,012 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-14 06:06:47,021 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-14 06:06:47,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-14 06:06:47,133 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:06:47,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1455504580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:47,134 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:47,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-07-14 06:06:47,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346552004] [2022-07-14 06:06:47,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:47,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-14 06:06:47,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:47,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-14 06:06:47,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1079, Unknown=4, NotChecked=204, Total=1406 [2022-07-14 06:06:47,136 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:47,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:47,684 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-14 06:06:47,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 06:06:47,684 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-14 06:06:47,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:47,685 INFO L225 Difference]: With dead ends: 58 [2022-07-14 06:06:47,685 INFO L226 Difference]: Without dead ends: 45 [2022-07-14 06:06:47,685 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=2107, Unknown=4, NotChecked=288, Total=2652 [2022-07-14 06:06:47,686 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:47,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 218 Unchecked, 0.1s Time] [2022-07-14 06:06:47,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-14 06:06:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-14 06:06:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:47,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-14 06:06:47,687 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 27 [2022-07-14 06:06:47,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:47,687 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-14 06:06:47,687 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-14 06:06:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-14 06:06:47,687 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:47,687 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:47,712 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-14 06:06:47,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:47,888 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:06:47,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:47,888 INFO L85 PathProgramCache]: Analyzing trace with hash 614687385, now seen corresponding path program 2 times [2022-07-14 06:06:47,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:47,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850432121] [2022-07-14 06:06:47,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:47,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:47,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:48,112 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:06:48,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:48,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850432121] [2022-07-14 06:06:48,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850432121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:48,112 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1532205407] [2022-07-14 06:06:48,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:06:48,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:48,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:48,113 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:48,114 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-14 06:06:48,193 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:06:48,193 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:06:48,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-14 06:06:48,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:48,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:48,207 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-14 06:06:48,211 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-14 06:06:48,518 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:06:48,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:06:48,998 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-14 06:06:48,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1532205407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:06:48,999 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:06:48,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-14 06:06:48,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085443683] [2022-07-14 06:06:48,999 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:06:48,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-14 06:06:49,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:06:49,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-14 06:06:49,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-07-14 06:06:49,001 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:06:49,940 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-14 06:06:49,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-14 06:06:49,940 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-14 06:06:49,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:06:49,940 INFO L225 Difference]: With dead ends: 54 [2022-07-14 06:06:49,941 INFO L226 Difference]: Without dead ends: 54 [2022-07-14 06:06:49,941 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=349, Invalid=2407, Unknown=0, NotChecked=0, Total=2756 [2022-07-14 06:06:49,942 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:06:49,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:06:49,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-14 06:06:49,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-14 06:06:49,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:49,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-14 06:06:49,943 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2022-07-14 06:06:49,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:06:49,943 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-14 06:06:49,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:06:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-14 06:06:49,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-14 06:06:49,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:06:49,944 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:06:49,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-14 06:06:50,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:50,161 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-14 06:06:50,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:06:50,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1981775400, now seen corresponding path program 3 times [2022-07-14 06:06:50,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:06:50,162 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443179277] [2022-07-14 06:06:50,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:06:50,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:06:50,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:06:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:50,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:06:50,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443179277] [2022-07-14 06:06:50,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443179277] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:06:50,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307931770] [2022-07-14 06:06:50,392 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:06:50,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:06:50,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:06:50,393 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:06:50,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-14 06:06:50,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-14 06:06:50,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:06:50,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-14 06:06:50,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:06:50,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:06:50,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:50,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 21 treesize of output 20 [2022-07-14 06:06:50,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-14 06:06:50,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-14 06:06:50,956 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:06:50,958 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:06:50,958 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-14 06:06:50,960 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:06:50,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:01,844 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-14 06:07:03,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-14 06:07:04,349 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-14 06:07:04,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 360 [2022-07-14 06:07:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-14 06:07:04,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307931770] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:04,689 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:04,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2022-07-14 06:07:04,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218320798] [2022-07-14 06:07:04,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:04,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:07:04,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:04,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:07:04,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1358, Unknown=16, NotChecked=228, Total=1722 [2022-07-14 06:07:04,690 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:05,387 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (< 2 |c_ULTIMATE.start_main_~length~0#1|) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (<= 3 |c_ULTIMATE.start_main_~length~0#1|) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~length~0#1| 3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-14 06:07:05,857 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cstrncpy_~src#1.base| |c_ULTIMATE.start_cstrncpy_~dst#1.base|)) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| 3) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (= |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 0) (= |c_ULTIMATE.start_cstrncpy_~src#1.offset| 0)) is different from false [2022-07-14 06:07:06,329 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrncpy_~d~0#1.base| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|)))) is different from false [2022-07-14 06:07:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:06,526 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-14 06:07:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-14 06:07:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-14 06:07:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:06,526 INFO L225 Difference]: With dead ends: 78 [2022-07-14 06:07:06,527 INFO L226 Difference]: Without dead ends: 59 [2022-07-14 06:07:06,530 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 15.6s TimeCoverageRelationStatistics Valid=217, Invalid=2338, Unknown=19, NotChecked=618, Total=3192 [2022-07-14 06:07:06,531 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:06,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 346 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-07-14 06:07:06,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-14 06:07:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-14 06:07:06,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:06,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-14 06:07:06,533 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-07-14 06:07:06,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:06,533 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-14 06:07:06,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:06,533 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-14 06:07:06,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-14 06:07:06,533 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:06,533 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:06,551 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-14 06:07:06,751 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-14 06:07:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 207254747, now seen corresponding path program 4 times [2022-07-14 06:07:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:06,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827520037] [2022-07-14 06:07:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:06,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:06,885 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:06,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827520037] [2022-07-14 06:07:06,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827520037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:06,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [845879658] [2022-07-14 06:07:06,885 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:07:06,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:06,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:06,887 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:07:06,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-14 06:07:06,988 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:07:06,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:06,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-14 06:07:06,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:07,005 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:07:07,006 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-14 06:07:07,270 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:07,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:07,590 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:07,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [845879658] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:07,591 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:07,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-14 06:07:07,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927191368] [2022-07-14 06:07:07,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:07,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-14 06:07:07,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:07,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-14 06:07:07,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-07-14 06:07:07,592 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:08,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:08,124 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-14 06:07:08,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-14 06:07:08,124 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-14 06:07:08,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:08,125 INFO L225 Difference]: With dead ends: 56 [2022-07-14 06:07:08,125 INFO L226 Difference]: Without dead ends: 56 [2022-07-14 06:07:08,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2022-07-14 06:07:08,126 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:08,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 217 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:07:08,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-14 06:07:08,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-14 06:07:08,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:08,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-14 06:07:08,127 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 41 [2022-07-14 06:07:08,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:08,127 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-14 06:07:08,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:08,128 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-14 06:07:08,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-14 06:07:08,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:08,128 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:08,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-14 06:07:08,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-14 06:07:08,336 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-14 06:07:08,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:08,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1595560281, now seen corresponding path program 5 times [2022-07-14 06:07:08,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:08,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362030268] [2022-07-14 06:07:08,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:08,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:08,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:08,629 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:08,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362030268] [2022-07-14 06:07:08,630 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362030268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:08,630 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622962377] [2022-07-14 06:07:08,630 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:07:08,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:08,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:08,631 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 06:07:08,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-14 06:07:08,770 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-14 06:07:08,771 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:08,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-14 06:07:08,780 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:08,783 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-14 06:07:08,936 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-14 06:07:09,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:09,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:09,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 14 treesize of output 16 [2022-07-14 06:07:09,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:07:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:09,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:09,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:07:09,153 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:09,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_441) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:09,166 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:09,182 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_440) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:09,188 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:09,190 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:09,195 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:09,199 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:09,199 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-14 06:07:09,203 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:09,203 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-14 06:07:09,206 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-14 06:07:09,352 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-14 06:07:09,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622962377] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:09,352 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:09,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 43 [2022-07-14 06:07:09,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047187288] [2022-07-14 06:07:09,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:09,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-14 06:07:09,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:09,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-14 06:07:09,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1095, Unknown=8, NotChecked=584, Total=1806 [2022-07-14 06:07:09,353 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:09,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:09,831 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-14 06:07:09,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 06:07:09,831 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-14 06:07:09,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:09,832 INFO L225 Difference]: With dead ends: 88 [2022-07-14 06:07:09,832 INFO L226 Difference]: Without dead ends: 63 [2022-07-14 06:07:09,833 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=178, Invalid=1652, Unknown=8, NotChecked=712, Total=2550 [2022-07-14 06:07:09,833 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:09,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 475 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 280 Unchecked, 0.2s Time] [2022-07-14 06:07:09,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-14 06:07:09,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-14 06:07:09,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:09,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-14 06:07:09,836 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 47 [2022-07-14 06:07:09,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:09,836 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-14 06:07:09,836 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:09,836 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-14 06:07:09,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-14 06:07:09,836 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:09,837 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:09,853 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-14 06:07:10,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-14 06:07:10,037 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-14 06:07:10,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:10,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1297179492, now seen corresponding path program 6 times [2022-07-14 06:07:10,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:10,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [35014744] [2022-07-14 06:07:10,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:10,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:10,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:10,209 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:10,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:10,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [35014744] [2022-07-14 06:07:10,209 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [35014744] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:10,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117628780] [2022-07-14 06:07:10,209 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:07:10,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:10,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:10,211 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-14 06:07:10,212 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-14 06:07:10,333 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-14 06:07:10,334 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:10,336 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-14 06:07:10,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:10,348 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:07:10,348 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-14 06:07:10,613 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:10,614 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:10,982 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:10,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117628780] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:10,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:10,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2022-07-14 06:07:10,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660975875] [2022-07-14 06:07:10,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:10,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-14 06:07:10,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:10,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-14 06:07:10,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-07-14 06:07:10,983 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:11,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:11,408 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-14 06:07:11,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 06:07:11,409 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-14 06:07:11,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:11,409 INFO L225 Difference]: With dead ends: 61 [2022-07-14 06:07:11,409 INFO L226 Difference]: Without dead ends: 61 [2022-07-14 06:07:11,410 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 06:07:11,410 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:11,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 263 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:07:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-14 06:07:11,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-07-14 06:07:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:11,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-14 06:07:11,412 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 51 [2022-07-14 06:07:11,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:11,412 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-14 06:07:11,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:11,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-14 06:07:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-14 06:07:11,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:11,413 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:11,430 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-14 06:07:11,619 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-14 06:07:11,620 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-14 06:07:11,620 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -351804326, now seen corresponding path program 7 times [2022-07-14 06:07:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:11,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139014095] [2022-07-14 06:07:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:11,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:11,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:11,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139014095] [2022-07-14 06:07:11,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139014095] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:11,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1680514325] [2022-07-14 06:07:11,995 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:07:11,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:11,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:11,996 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-14 06:07:11,997 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-14 06:07:12,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:12,076 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-14 06:07:12,078 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:12,084 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-14 06:07:12,249 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-14 06:07:12,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:12,466 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:12,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 16 treesize of output 18 [2022-07-14 06:07:12,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 14 treesize of output 16 [2022-07-14 06:07:12,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-14 06:07:12,566 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:12,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:12,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:07:12,581 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:12,588 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:12,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:12,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:12,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:12,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_545) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:12,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:12,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:12,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:12,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:12,625 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-14 06:07:12,629 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:12,629 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-14 06:07:12,631 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-14 06:07:12,821 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-14 06:07:12,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1680514325] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:12,821 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:12,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 51 [2022-07-14 06:07:12,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996010912] [2022-07-14 06:07:12,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:12,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-14 06:07:12,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:12,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-14 06:07:12,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1529, Unknown=10, NotChecked=870, Total=2550 [2022-07-14 06:07:12,823 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:13,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:13,553 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-14 06:07:13,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-14 06:07:13,553 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-14 06:07:13,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:13,553 INFO L225 Difference]: With dead ends: 98 [2022-07-14 06:07:13,554 INFO L226 Difference]: Without dead ends: 67 [2022-07-14 06:07:13,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=2469, Unknown=10, NotChecked=1090, Total=3782 [2022-07-14 06:07:13,555 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:13,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 520 Unchecked, 0.3s Time] [2022-07-14 06:07:13,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-14 06:07:13,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-14 06:07:13,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:13,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-14 06:07:13,557 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2022-07-14 06:07:13,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:13,557 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-14 06:07:13,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:13,557 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-14 06:07:13,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 06:07:13,557 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:13,557 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:13,574 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-14 06:07:13,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-14 06:07:13,763 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-14 06:07:13,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:13,764 INFO L85 PathProgramCache]: Analyzing trace with hash -841664547, now seen corresponding path program 8 times [2022-07-14 06:07:13,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:13,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224934060] [2022-07-14 06:07:13,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:13,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:13,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:13,936 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:13,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:13,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224934060] [2022-07-14 06:07:13,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224934060] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:13,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830512597] [2022-07-14 06:07:13,937 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:07:13,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:13,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:13,938 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-14 06:07:13,940 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-14 06:07:14,021 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:07:14,022 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:14,023 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-14 06:07:14,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:14,245 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:14,246 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:14,516 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:07:14,546 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:14,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830512597] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:14,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:14,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2022-07-14 06:07:14,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230949423] [2022-07-14 06:07:14,547 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:14,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-14 06:07:14,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:14,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-14 06:07:14,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-14 06:07:14,548 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:15,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:15,213 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-07-14 06:07:15,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-14 06:07:15,214 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-14 06:07:15,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:15,214 INFO L225 Difference]: With dead ends: 72 [2022-07-14 06:07:15,214 INFO L226 Difference]: Without dead ends: 72 [2022-07-14 06:07:15,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=593, Invalid=2487, Unknown=0, NotChecked=0, Total=3080 [2022-07-14 06:07:15,215 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 554 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:15,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 330 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 06:07:15,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-14 06:07:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-14 06:07:15,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-14 06:07:15,217 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 61 [2022-07-14 06:07:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:15,217 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-14 06:07:15,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:15,217 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-14 06:07:15,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-14 06:07:15,217 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:15,218 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:15,238 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-14 06:07:15,423 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:15,423 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:07:15,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:15,424 INFO L85 PathProgramCache]: Analyzing trace with hash -321797194, now seen corresponding path program 3 times [2022-07-14 06:07:15,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:15,424 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069618654] [2022-07-14 06:07:15,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:15,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:15,754 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-14 06:07:15,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069618654] [2022-07-14 06:07:15,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069618654] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:15,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890802765] [2022-07-14 06:07:15,754 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:07:15,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:15,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:15,755 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-14 06:07:15,757 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-14 06:07:15,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-14 06:07:15,943 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:15,946 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-14 06:07:15,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:15,957 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:07:15,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-14 06:07:15,964 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-14 06:07:16,547 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-14 06:07:16,547 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:17,409 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-14 06:07:17,409 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890802765] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:17,409 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:17,410 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2022-07-14 06:07:17,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632835702] [2022-07-14 06:07:17,410 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:17,410 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-14 06:07:17,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:17,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-14 06:07:17,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2022-07-14 06:07:17,411 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:18,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:18,844 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-14 06:07:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:07:18,844 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-14 06:07:18,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:18,844 INFO L225 Difference]: With dead ends: 70 [2022-07-14 06:07:18,844 INFO L226 Difference]: Without dead ends: 70 [2022-07-14 06:07:18,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=764, Invalid=5556, Unknown=0, NotChecked=0, Total=6320 [2022-07-14 06:07:18,846 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:18,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:07:18,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-14 06:07:18,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-14 06:07:18,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:18,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-14 06:07:18,847 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2022-07-14 06:07:18,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:18,847 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-14 06:07:18,847 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:18,848 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-14 06:07:18,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 06:07:18,848 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:18,848 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:18,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:19,052 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:19,052 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-14 06:07:19,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:19,053 INFO L85 PathProgramCache]: Analyzing trace with hash 1711491803, now seen corresponding path program 9 times [2022-07-14 06:07:19,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:19,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499619672] [2022-07-14 06:07:19,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:19,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:19,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:19,599 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:19,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499619672] [2022-07-14 06:07:19,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499619672] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:19,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175184589] [2022-07-14 06:07:19,599 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:07:19,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:19,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:19,601 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-14 06:07:19,602 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-14 06:07:19,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-14 06:07:19,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:19,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 155 conjunts are in the unsatisfiable core [2022-07-14 06:07:19,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:19,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:07:20,080 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-14 06:07:20,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-14 06:07:20,381 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:20,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:20,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:20,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:20,895 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:07:20,896 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:20,896 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-14 06:07:20,899 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:20,899 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:20,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:07:20,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:20,921 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_726) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:20,926 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_725) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:07:20,939 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_724) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:20,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_723) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:20,963 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:20,972 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:20,972 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-14 06:07:20,976 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:20,976 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-14 06:07:20,978 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-14 06:07:21,266 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-14 06:07:21,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175184589] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:21,267 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:21,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 72 [2022-07-14 06:07:21,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404858849] [2022-07-14 06:07:21,267 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:21,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-14 06:07:21,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:21,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-14 06:07:21,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3357, Unknown=12, NotChecked=1524, Total=5112 [2022-07-14 06:07:21,269 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:22,154 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-07-14 06:07:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-14 06:07:22,155 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-14 06:07:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:22,155 INFO L225 Difference]: With dead ends: 112 [2022-07-14 06:07:22,155 INFO L226 Difference]: Without dead ends: 75 [2022-07-14 06:07:22,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=346, Invalid=5542, Unknown=12, NotChecked=1932, Total=7832 [2022-07-14 06:07:22,156 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:22,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 822 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 610 Unchecked, 0.2s Time] [2022-07-14 06:07:22,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-14 06:07:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-14 06:07:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:22,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-14 06:07:22,159 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2022-07-14 06:07:22,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:22,159 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-14 06:07:22,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:22,159 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-14 06:07:22,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-14 06:07:22,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:22,160 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:22,176 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:22,360 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:22,360 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-14 06:07:22,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:22,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1133270686, now seen corresponding path program 10 times [2022-07-14 06:07:22,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:22,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031069143] [2022-07-14 06:07:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:22,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:22,608 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:22,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031069143] [2022-07-14 06:07:22,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031069143] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:22,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1452657580] [2022-07-14 06:07:22,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:07:22,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:22,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:22,610 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-14 06:07:22,611 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-14 06:07:22,818 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:07:22,818 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:22,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-14 06:07:22,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:23,079 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:23,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:23,374 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-14 06:07:23,415 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:23,415 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1452657580] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:23,416 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:23,416 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2022-07-14 06:07:23,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570404409] [2022-07-14 06:07:23,416 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:23,416 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-14 06:07:23,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:23,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-14 06:07:23,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2022-07-14 06:07:23,417 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:23,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:23,997 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-14 06:07:23,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-14 06:07:23,998 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-14 06:07:23,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:23,998 INFO L225 Difference]: With dead ends: 80 [2022-07-14 06:07:23,998 INFO L226 Difference]: Without dead ends: 80 [2022-07-14 06:07:23,998 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=655, Invalid=2767, Unknown=0, NotChecked=0, Total=3422 [2022-07-14 06:07:23,999 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:23,999 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 06:07:23,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-14 06:07:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-14 06:07:24,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:24,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-07-14 06:07:24,000 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2022-07-14 06:07:24,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:24,001 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-07-14 06:07:24,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-07-14 06:07:24,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-14 06:07:24,001 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:24,001 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:24,018 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-14 06:07:24,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-14 06:07:24,214 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-14 06:07:24,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:24,214 INFO L85 PathProgramCache]: Analyzing trace with hash 1392415964, now seen corresponding path program 11 times [2022-07-14 06:07:24,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:24,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1282512453] [2022-07-14 06:07:24,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:24,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:24,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:24,833 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:24,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:24,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1282512453] [2022-07-14 06:07:24,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1282512453] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:24,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1805680423] [2022-07-14 06:07:24,834 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:07:24,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:24,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:24,835 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-14 06:07:24,836 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-14 06:07:25,312 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-14 06:07:25,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:25,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-14 06:07:25,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:25,339 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:07:25,339 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-14 06:07:25,348 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-14 06:07:25,672 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-14 06:07:25,904 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:26,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:26,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:26,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:26,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:26,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:26,840 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:26,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:07:26,989 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 45 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:26,989 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:28,258 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:28,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-14 06:07:28,265 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:28,265 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-14 06:07:28,268 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-14 06:07:28,912 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 66 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:28,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1805680423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:28,913 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:28,913 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 86 [2022-07-14 06:07:28,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303210205] [2022-07-14 06:07:28,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:28,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-14 06:07:28,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:28,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-14 06:07:28,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=6862, Unknown=5, NotChecked=0, Total=7310 [2022-07-14 06:07:28,915 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:31,058 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-14 06:07:31,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-14 06:07:31,059 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-14 06:07:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:31,059 INFO L225 Difference]: With dead ends: 134 [2022-07-14 06:07:31,059 INFO L226 Difference]: Without dead ends: 91 [2022-07-14 06:07:31,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1102, Invalid=14895, Unknown=5, NotChecked=0, Total=16002 [2022-07-14 06:07:31,061 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:31,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1039 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 383 Unchecked, 0.2s Time] [2022-07-14 06:07:31,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-14 06:07:31,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-14 06:07:31,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:31,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-14 06:07:31,062 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2022-07-14 06:07:31,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:31,063 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-14 06:07:31,063 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:31,063 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-14 06:07:31,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-14 06:07:31,063 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:31,063 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:31,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-07-14 06:07:31,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:31,281 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-14 06:07:31,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:31,281 INFO L85 PathProgramCache]: Analyzing trace with hash -2138844579, now seen corresponding path program 12 times [2022-07-14 06:07:31,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:31,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014665967] [2022-07-14 06:07:31,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:31,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:32,058 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:32,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014665967] [2022-07-14 06:07:32,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014665967] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:32,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303459703] [2022-07-14 06:07:32,058 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:07:32,059 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:32,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:32,060 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-14 06:07:32,060 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-14 06:07:32,364 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-14 06:07:32,364 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:32,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-14 06:07:32,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:32,380 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-14 06:07:32,798 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-14 06:07:32,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:33,123 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:33,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 16 treesize of output 18 [2022-07-14 06:07:33,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:33,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 16 treesize of output 18 [2022-07-14 06:07:33,695 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:33,829 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:33,944 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:07:33,945 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:33,945 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-14 06:07:33,948 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:33,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:33,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-14 06:07:33,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:33,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_950) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:33,978 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,000 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_949) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,013 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_948) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,018 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:34,024 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_947) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:34,030 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,040 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_946) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_945) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,074 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:34,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:34,078 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-14 06:07:34,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:34,082 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-14 06:07:34,084 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-14 06:07:34,537 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-14 06:07:34,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303459703] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:34,538 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:34,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 31] total 92 [2022-07-14 06:07:34,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579947419] [2022-07-14 06:07:34,538 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:34,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-07-14 06:07:34,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:34,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-07-14 06:07:34,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5469, Unknown=16, NotChecked=2608, Total=8372 [2022-07-14 06:07:34,540 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:36,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:36,198 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-07-14 06:07:36,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-14 06:07:36,199 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-14 06:07:36,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:36,199 INFO L225 Difference]: With dead ends: 144 [2022-07-14 06:07:36,199 INFO L226 Difference]: Without dead ends: 95 [2022-07-14 06:07:36,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 16 IntricatePredicates, 11 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=487, Invalid=10481, Unknown=16, NotChecked=3536, Total=14520 [2022-07-14 06:07:36,201 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:36,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1499 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-07-14 06:07:36,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-14 06:07:36,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-14 06:07:36,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:36,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-14 06:07:36,202 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2022-07-14 06:07:36,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:36,202 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-14 06:07:36,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:36,202 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-14 06:07:36,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 06:07:36,203 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:36,203 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:36,223 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-14 06:07:36,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:36,403 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-14 06:07:36,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:36,404 INFO L85 PathProgramCache]: Analyzing trace with hash 1788632736, now seen corresponding path program 13 times [2022-07-14 06:07:36,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:36,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245320393] [2022-07-14 06:07:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245320393] [2022-07-14 06:07:36,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245320393] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:36,699 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [874381006] [2022-07-14 06:07:36,699 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:07:36,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:36,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:36,701 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-14 06:07:36,701 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-14 06:07:36,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:36,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-14 06:07:36,818 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:37,154 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:37,154 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:37,601 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-14 06:07:37,647 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:37,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [874381006] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:37,651 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:37,651 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 48 [2022-07-14 06:07:37,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463934549] [2022-07-14 06:07:37,651 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:37,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-14 06:07:37,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:37,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-14 06:07:37,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2022-07-14 06:07:37,653 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:38,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:38,802 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-14 06:07:38,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-14 06:07:38,802 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-07-14 06:07:38,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:38,803 INFO L225 Difference]: With dead ends: 100 [2022-07-14 06:07:38,803 INFO L226 Difference]: Without dead ends: 100 [2022-07-14 06:07:38,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2022-07-14 06:07:38,804 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 513 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:38,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 676 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-14 06:07:38,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-14 06:07:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-14 06:07:38,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-14 06:07:38,805 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 91 [2022-07-14 06:07:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:38,806 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-14 06:07:38,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-07-14 06:07:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-14 06:07:38,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:38,806 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:38,825 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-14 06:07:39,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:39,025 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-14 06:07:39,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -1984621730, now seen corresponding path program 14 times [2022-07-14 06:07:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:39,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179423772] [2022-07-14 06:07:39,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:39,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:39,887 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:39,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:39,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179423772] [2022-07-14 06:07:39,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179423772] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:39,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1662243519] [2022-07-14 06:07:39,888 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:07:39,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:39,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:39,889 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-14 06:07:39,889 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-14 06:07:40,018 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:07:40,018 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:40,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-14 06:07:40,024 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:40,028 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-14 06:07:40,330 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-14 06:07:40,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:07:40,777 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:40,936 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:41,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:41,293 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:41,484 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:41,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:41,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:42,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:42,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 06:07:42,188 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:42,188 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:43,842 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-14 06:07:43,851 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)))) is different from false [2022-07-14 06:07:43,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-14 06:07:43,868 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:43,869 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-14 06:07:43,874 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:43,875 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-14 06:07:43,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 16 treesize of output 12 [2022-07-14 06:07:43,881 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-14 06:07:44,559 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-14 06:07:44,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1662243519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:44,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:44,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 108 [2022-07-14 06:07:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653095482] [2022-07-14 06:07:44,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:44,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-14 06:07:44,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:44,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-14 06:07:44,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=659, Invalid=10263, Unknown=10, NotChecked=624, Total=11556 [2022-07-14 06:07:44,561 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:50,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:50,415 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2022-07-14 06:07:50,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-14 06:07:50,415 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-14 06:07:50,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:50,416 INFO L225 Difference]: With dead ends: 168 [2022-07-14 06:07:50,416 INFO L226 Difference]: Without dead ends: 113 [2022-07-14 06:07:50,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4049 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=1414, Invalid=20050, Unknown=10, NotChecked=876, Total=22350 [2022-07-14 06:07:50,418 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 242 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 873 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:50,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1671 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 905 Invalid, 0 Unknown, 873 Unchecked, 0.3s Time] [2022-07-14 06:07:50,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-14 06:07:50,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-14 06:07:50,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:50,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-14 06:07:50,420 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2022-07-14 06:07:50,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:50,421 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-14 06:07:50,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:50,421 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-14 06:07:50,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-14 06:07:50,422 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:50,422 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:50,447 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-07-14 06:07:50,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-14 06:07:50,639 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-14 06:07:50,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:50,640 INFO L85 PathProgramCache]: Analyzing trace with hash -682858529, now seen corresponding path program 15 times [2022-07-14 06:07:50,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:50,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429549784] [2022-07-14 06:07:50,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:50,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:50,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:51,818 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:51,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429549784] [2022-07-14 06:07:51,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429549784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:51,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518345478] [2022-07-14 06:07:51,818 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:07:51,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:51,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:51,819 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-14 06:07:51,821 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-14 06:07:53,757 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-14 06:07:53,757 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:07:53,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-14 06:07:53,783 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:07:53,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:07:54,408 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-14 06:07:54,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:54,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:54,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 16 treesize of output 18 [2022-07-14 06:07:55,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:07:55,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:55,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 16 treesize of output 18 [2022-07-14 06:07:55,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:55,728 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:55,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:07:56,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:07:56,010 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:56,010 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-14 06:07:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:56,013 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:07:56,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-14 06:07:56,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:56,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1224) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:07:56,037 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1223) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,067 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1222) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,072 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)))) is different from false [2022-07-14 06:07:56,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1221) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:07:56,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1220) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,093 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1219) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,115 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:07:56,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1218) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:07:56,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1217) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:07:56,144 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:07:56,156 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:56,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-14 06:07:56,161 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:07:56,161 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-14 06:07:56,163 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-14 06:07:56,796 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-14 06:07:56,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518345478] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:07:56,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:07:56,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 37] total 112 [2022-07-14 06:07:56,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342783220] [2022-07-14 06:07:56,796 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:07:56,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-14 06:07:56,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:07:56,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-14 06:07:56,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=8093, Unknown=20, NotChecked=3980, Total=12432 [2022-07-14 06:07:56,798 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:58,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:07:58,974 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-14 06:07:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-14 06:07:58,974 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-14 06:07:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:07:58,975 INFO L225 Difference]: With dead ends: 176 [2022-07-14 06:07:58,975 INFO L226 Difference]: Without dead ends: 115 [2022-07-14 06:07:58,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 20 IntricatePredicates, 13 DeprecatedPredicates, 4331 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=574, Invalid=14738, Unknown=20, NotChecked=5260, Total=20592 [2022-07-14 06:07:58,976 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1670 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:07:58,976 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1959 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1105 Invalid, 0 Unknown, 1670 Unchecked, 0.4s Time] [2022-07-14 06:07:58,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-14 06:07:58,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-14 06:07:58,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) internal successors, (113), 111 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:58,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-14 06:07:58,978 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-07-14 06:07:58,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:07:58,978 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-14 06:07:58,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:07:58,979 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-14 06:07:58,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 06:07:58,979 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:07:58,979 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:07:58,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-07-14 06:07:59,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-14 06:07:59,187 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-14 06:07:59,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:07:59,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1213254494, now seen corresponding path program 16 times [2022-07-14 06:07:59,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:07:59,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703870799] [2022-07-14 06:07:59,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:07:59,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:07:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:07:59,562 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:07:59,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:07:59,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703870799] [2022-07-14 06:07:59,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703870799] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:07:59,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1906735508] [2022-07-14 06:07:59,562 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:07:59,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:07:59,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:07:59,563 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-14 06:07:59,571 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-14 06:08:00,255 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:08:00,255 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:00,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-14 06:08:00,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:00,278 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:08:00,278 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-14 06:08:00,998 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:00,998 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:01,951 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1906735508] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:01,951 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:01,951 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 72 [2022-07-14 06:08:01,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034646943] [2022-07-14 06:08:01,952 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:01,952 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-14 06:08:01,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:01,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-14 06:08:01,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4643, Unknown=0, NotChecked=0, Total=5256 [2022-07-14 06:08:01,953 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:02,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:02,976 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-14 06:08:02,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-14 06:08:02,977 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-14 06:08:02,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:02,977 INFO L225 Difference]: With dead ends: 120 [2022-07-14 06:08:02,977 INFO L226 Difference]: Without dead ends: 120 [2022-07-14 06:08:02,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1756, Invalid=7750, Unknown=0, NotChecked=0, Total=9506 [2022-07-14 06:08:02,978 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 471 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:02,978 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 868 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-14 06:08:02,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-14 06:08:02,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-14 06:08:02,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:02,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-07-14 06:08:02,980 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2022-07-14 06:08:02,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:02,980 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-07-14 06:08:02,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-07-14 06:08:02,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 06:08:02,980 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:02,981 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:02,998 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2022-07-14 06:08:03,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-14 06:08:03,181 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-14 06:08:03,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:03,181 INFO L85 PathProgramCache]: Analyzing trace with hash 547086304, now seen corresponding path program 17 times [2022-07-14 06:08:03,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:03,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103025109] [2022-07-14 06:08:03,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:03,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:03,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:04,437 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:04,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:04,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103025109] [2022-07-14 06:08:04,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103025109] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:04,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2090569977] [2022-07-14 06:08:04,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:08:04,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:04,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:04,439 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-14 06:08:04,440 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-14 06:08:07,918 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-14 06:08:07,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:07,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-14 06:08:07,941 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:07,951 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-14 06:08:07,951 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-14 06:08:07,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-14 06:08:08,631 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-14 06:08:08,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 16 treesize of output 18 [2022-07-14 06:08:09,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:09,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:09,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-14 06:08:09,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-14 06:08:09,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:09,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:10,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:10,342 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:10,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:10,725 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:10,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-14 06:08:10,934 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 153 proven. 389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:10,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:13,517 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:13,517 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-14 06:08:13,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:13,521 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-14 06:08:13,523 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-14 06:08:14,749 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 190 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:14,749 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2090569977] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:14,749 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:14,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 39] total 126 [2022-07-14 06:08:14,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293874346] [2022-07-14 06:08:14,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:14,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-14 06:08:14,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:14,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-14 06:08:14,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=14910, Unknown=11, NotChecked=0, Total=15750 [2022-07-14 06:08:14,751 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:19,369 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2022-07-14 06:08:19,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-14 06:08:19,370 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-14 06:08:19,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:19,370 INFO L225 Difference]: With dead ends: 200 [2022-07-14 06:08:19,370 INFO L226 Difference]: Without dead ends: 133 [2022-07-14 06:08:19,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5972 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=2064, Invalid=32707, Unknown=11, NotChecked=0, Total=34782 [2022-07-14 06:08:19,372 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 395 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:19,372 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2613 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 814 Unchecked, 0.4s Time] [2022-07-14 06:08:19,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-14 06:08:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-07-14 06:08:19,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-07-14 06:08:19,389 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 117 [2022-07-14 06:08:19,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:19,389 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-07-14 06:08:19,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:19,389 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-07-14 06:08:19,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-14 06:08:19,390 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:19,390 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:19,397 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-14 06:08:19,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:19,596 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-14 06:08:19,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:19,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1821215585, now seen corresponding path program 18 times [2022-07-14 06:08:19,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:19,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735827950] [2022-07-14 06:08:19,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:19,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:19,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:20,949 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:20,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735827950] [2022-07-14 06:08:20,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735827950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:20,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195277443] [2022-07-14 06:08:20,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:08:20,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:20,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:20,950 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-14 06:08:20,951 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-14 06:08:24,043 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-14 06:08:24,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:24,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 237 conjunts are in the unsatisfiable core [2022-07-14 06:08:24,062 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:24,073 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-14 06:08:24,818 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-14 06:08:25,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:25,235 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:25,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:25,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:25,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 16 treesize of output 18 [2022-07-14 06:08:25,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:26,005 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:26,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:26,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:26,611 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:26,758 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:08:26,760 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:26,760 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-14 06:08:26,763 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:26,763 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:26,772 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:08:26,777 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:08:26,784 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1555) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:08:26,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:08:26,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1554) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1553) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:08:26,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1552) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:08:26,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1551) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:08:26,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1550) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,915 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1549) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:08:26,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1548) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:08:26,940 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:08:26,954 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:08:26,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:08:26,967 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:08:26,979 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:26,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-14 06:08:26,984 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:26,984 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-14 06:08:26,986 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-14 06:08:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-14 06:08:27,805 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195277443] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:27,805 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:27,805 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 43, 43] total 132 [2022-07-14 06:08:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251768464] [2022-07-14 06:08:27,805 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:27,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-14 06:08:27,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:27,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-14 06:08:27,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=11229, Unknown=24, NotChecked=5640, Total=17292 [2022-07-14 06:08:27,807 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:30,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:30,932 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-07-14 06:08:30,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-14 06:08:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-14 06:08:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:30,933 INFO L225 Difference]: With dead ends: 208 [2022-07-14 06:08:30,933 INFO L226 Difference]: Without dead ends: 135 [2022-07-14 06:08:30,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 24 IntricatePredicates, 13 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=697, Invalid=21725, Unknown=24, NotChecked=7656, Total=30102 [2022-07-14 06:08:30,934 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2969 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:30,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3096 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2369 Invalid, 0 Unknown, 2969 Unchecked, 0.7s Time] [2022-07-14 06:08:30,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-14 06:08:30,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-14 06:08:30,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:30,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-07-14 06:08:30,936 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2022-07-14 06:08:30,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:30,936 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-07-14 06:08:30,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:30,936 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-07-14 06:08:30,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-14 06:08:30,937 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:30,937 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:30,945 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-07-14 06:08:31,144 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:31,145 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-14 06:08:31,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:31,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1005234012, now seen corresponding path program 19 times [2022-07-14 06:08:31,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:31,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140609544] [2022-07-14 06:08:31,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:31,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:31,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:31,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140609544] [2022-07-14 06:08:31,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140609544] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:31,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1023841363] [2022-07-14 06:08:31,624 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:08:31,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:31,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:31,625 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-14 06:08:31,626 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-14 06:08:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:31,811 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-14 06:08:31,813 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:32,391 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:32,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:33,084 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-14 06:08:33,149 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:33,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1023841363] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:33,149 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:33,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 64 [2022-07-14 06:08:33,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138541397] [2022-07-14 06:08:33,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:33,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-14 06:08:33,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:33,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-14 06:08:33,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2022-07-14 06:08:33,150 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:35,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:35,057 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-14 06:08:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-14 06:08:35,058 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-07-14 06:08:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:35,058 INFO L225 Difference]: With dead ends: 140 [2022-07-14 06:08:35,058 INFO L226 Difference]: Without dead ends: 140 [2022-07-14 06:08:35,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2126, Invalid=8794, Unknown=0, NotChecked=0, Total=10920 [2022-07-14 06:08:35,059 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 773 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:35,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1119 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-14 06:08:35,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-14 06:08:35,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-14 06:08:35,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:35,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2022-07-14 06:08:35,061 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 131 [2022-07-14 06:08:35,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:35,061 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2022-07-14 06:08:35,061 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:35,061 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2022-07-14 06:08:35,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-14 06:08:35,062 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:35,062 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:35,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-14 06:08:35,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-14 06:08:35,268 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-14 06:08:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:35,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1834780062, now seen corresponding path program 20 times [2022-07-14 06:08:35,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:35,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734565065] [2022-07-14 06:08:35,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:35,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:36,851 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 50 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:36,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734565065] [2022-07-14 06:08:36,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734565065] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:36,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1514851357] [2022-07-14 06:08:36,852 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-14 06:08:36,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:36,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:36,853 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-14 06:08:36,854 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-14 06:08:37,045 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-14 06:08:37,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:37,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-14 06:08:37,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:37,060 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-14 06:08:37,741 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-14 06:08:38,074 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:38,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:38,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:38,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:38,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:38,873 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:39,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-14 06:08:39,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:39,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:39,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:39,814 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:40,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:40,209 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:40,210 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-14 06:08:40,422 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:40,422 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:08:43,744 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-14 06:08:43,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:43,749 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-14 06:08:43,754 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:08:43,754 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-14 06:08:43,756 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-14 06:08:45,112 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:45,112 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1514851357] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:08:45,113 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:08:45,113 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 46, 46] total 148 [2022-07-14 06:08:45,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717907231] [2022-07-14 06:08:45,113 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:08:45,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-07-14 06:08:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:08:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-07-14 06:08:45,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1229, Invalid=20516, Unknown=11, NotChecked=0, Total=21756 [2022-07-14 06:08:45,129 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:50,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:08:50,392 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2022-07-14 06:08:50,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-14 06:08:50,392 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-07-14 06:08:50,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:08:50,393 INFO L225 Difference]: With dead ends: 232 [2022-07-14 06:08:50,393 INFO L226 Difference]: Without dead ends: 153 [2022-07-14 06:08:50,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8541 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=2554, Invalid=39665, Unknown=11, NotChecked=0, Total=42230 [2022-07-14 06:08:50,396 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 600 mSDsluCounter, 2527 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2584 SdHoareTripleChecker+Invalid, 2787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1664 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-14 06:08:50,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2584 Invalid, 2787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1105 Invalid, 0 Unknown, 1664 Unchecked, 0.4s Time] [2022-07-14 06:08:50,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-14 06:08:50,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-14 06:08:50,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0136054421768708) internal successors, (149), 147 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:50,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-14 06:08:50,399 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 137 [2022-07-14 06:08:50,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:08:50,399 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-14 06:08:50,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:08:50,400 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-14 06:08:50,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-14 06:08:50,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:08:50,401 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:08:50,434 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Ended with exit code 0 [2022-07-14 06:08:50,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-07-14 06:08:50,615 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-14 06:08:50,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:08:50,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1006091491, now seen corresponding path program 21 times [2022-07-14 06:08:50,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:08:50,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594070150] [2022-07-14 06:08:50,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:08:50,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:08:50,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:08:52,502 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:08:52,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:08:52,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594070150] [2022-07-14 06:08:52,503 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594070150] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:08:52,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124788327] [2022-07-14 06:08:52,503 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-14 06:08:52,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:08:52,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:08:52,505 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-14 06:08:52,514 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-14 06:08:57,068 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-14 06:08:57,068 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:08:57,084 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 305 conjunts are in the unsatisfiable core [2022-07-14 06:08:57,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:08:57,095 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-14 06:08:58,106 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-14 06:08:58,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:58,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:58,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 16 treesize of output 18 [2022-07-14 06:08:59,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:59,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:08:59,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:08:59,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 06:08:59,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:00,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:00,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:00,429 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:00,624 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:09:00,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:01,009 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:09:01,011 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:01,011 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-14 06:09:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:01,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:09:01,026 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:09:01,042 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:09:01,050 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1932) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:09:01,055 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1931) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,073 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1930) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,087 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:09:01,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1929) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:09:01,100 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,108 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1928) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,114 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1927) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,127 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-14 06:09:01,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1926) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,141 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:09:01,148 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1925) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:09:01,154 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1924) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:09:01,175 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1923) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:09:01,181 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:09:01,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1922) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:09:01,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-14 06:09:01,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1921) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-14 06:09:01,208 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-14 06:09:01,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 13)) 0)) is different from false [2022-07-14 06:09:01,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:09:01,219 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:01,220 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-14 06:09:01,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:01,224 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-14 06:09:01,227 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-14 06:09:02,333 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 519 not checked. [2022-07-14 06:09:02,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124788327] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:09:02,333 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:09:02,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 49, 49] total 152 [2022-07-14 06:09:02,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006158487] [2022-07-14 06:09:02,333 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:09:02,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-07-14 06:09:02,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:09:02,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-07-14 06:09:02,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14877, Unknown=28, NotChecked=7588, Total=22952 [2022-07-14 06:09:02,336 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:06,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:09:06,474 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2022-07-14 06:09:06,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-14 06:09:06,475 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-07-14 06:09:06,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:09:06,475 INFO L225 Difference]: With dead ends: 240 [2022-07-14 06:09:06,476 INFO L226 Difference]: Without dead ends: 155 [2022-07-14 06:09:06,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 190 ConstructedPredicates, 28 IntricatePredicates, 7 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=735, Invalid=26081, Unknown=28, NotChecked=9828, Total=36672 [2022-07-14 06:09:06,477 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3896 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:09:06,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3601 Invalid, 6490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 3896 Unchecked, 0.9s Time] [2022-07-14 06:09:06,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-14 06:09:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-07-14 06:09:06,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0132450331125828) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:06,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-14 06:09:06,480 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2022-07-14 06:09:06,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:09:06,480 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-14 06:09:06,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:06,481 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-14 06:09:06,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-14 06:09:06,481 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:09:06,481 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:09:06,493 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-14 06:09:06,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:09:06,682 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-14 06:09:06,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:09:06,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1386171046, now seen corresponding path program 22 times [2022-07-14 06:09:06,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:09:06,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356100300] [2022-07-14 06:09:06,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:09:06,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:09:06,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:09:07,266 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 276 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:07,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:09:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356100300] [2022-07-14 06:09:07,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356100300] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:09:07,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218861769] [2022-07-14 06:09:07,267 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-14 06:09:07,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:09:07,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:09:07,275 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-14 06:09:07,277 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-14 06:09:08,570 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-14 06:09:08,570 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:09:08,576 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-14 06:09:08,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:09:09,345 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:09,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:09:10,125 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-14 06:09:10,824 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:10,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218861769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:09:10,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:09:10,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 86 [2022-07-14 06:09:10,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018069937] [2022-07-14 06:09:10,825 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:09:10,826 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-14 06:09:10,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:09:10,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-14 06:09:10,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=6572, Unknown=0, NotChecked=0, Total=7482 [2022-07-14 06:09:10,827 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:12,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:09:12,630 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-14 06:09:12,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-14 06:09:12,630 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-07-14 06:09:12,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:09:12,631 INFO L225 Difference]: With dead ends: 160 [2022-07-14 06:09:12,631 INFO L226 Difference]: Without dead ends: 160 [2022-07-14 06:09:12,632 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=2988, Invalid=11292, Unknown=0, NotChecked=0, Total=14280 [2022-07-14 06:09:12,632 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 796 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-14 06:09:12,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1412 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-14 06:09:12,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-14 06:09:12,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-14 06:09:12,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:12,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2022-07-14 06:09:12,634 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2022-07-14 06:09:12,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:09:12,634 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2022-07-14 06:09:12,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:12,635 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2022-07-14 06:09:12,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-14 06:09:12,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:09:12,635 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:09:12,663 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-14 06:09:12,851 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:09:12,851 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-14 06:09:12,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:09:12,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679076, now seen corresponding path program 23 times [2022-07-14 06:09:12,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:09:12,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335889268] [2022-07-14 06:09:12,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:09:12,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:09:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:09:14,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 58 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:14,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:09:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335889268] [2022-07-14 06:09:14,691 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335889268] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:09:14,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1914685309] [2022-07-14 06:09:14,691 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-14 06:09:14,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:09:14,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:09:14,692 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-14 06:09:14,693 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-14 06:09:36,721 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-07-14 06:09:36,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:09:36,749 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-14 06:09:36,753 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:09:36,758 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-14 06:09:36,761 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-14 06:09:37,794 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-14 06:09:38,209 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:38,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:09:38,653 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:09:38,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:39,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-14 06:09:39,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:39,606 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:09:39,854 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:40,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 17 treesize of output 19 [2022-07-14 06:09:40,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:40,686 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 06:09:40,958 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:09:41,229 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:09:41,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-14 06:09:41,759 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:41,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-14 06:09:42,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 325 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:09:42,049 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:09:46,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)))) is different from false [2022-07-14 06:09:46,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0))) is different from false [2022-07-14 06:09:46,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) is different from false [2022-07-14 06:09:46,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:46,081 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-14 06:09:46,086 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:09:46,086 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-14 06:09:46,089 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-14 06:09:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 378 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-14 06:09:49,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1914685309] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:09:49,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:09:49,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 52, 52] total 168 [2022-07-14 06:09:49,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567460251] [2022-07-14 06:09:49,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:09:49,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-07-14 06:09:49,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:09:49,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-07-14 06:09:49,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=25753, Unknown=20, NotChecked=984, Total=28056 [2022-07-14 06:09:49,097 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:58,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:09:58,612 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2022-07-14 06:09:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-07-14 06:09:58,613 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-14 06:09:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:09:58,613 INFO L225 Difference]: With dead ends: 264 [2022-07-14 06:09:58,613 INFO L226 Difference]: Without dead ends: 173 [2022-07-14 06:09:58,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 10662 ImplicationChecksByTransitivity, 19.8s TimeCoverageRelationStatistics Valid=3164, Invalid=57098, Unknown=20, NotChecked=1470, Total=61752 [2022-07-14 06:09:58,616 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 627 mSDsluCounter, 4119 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 4184 SdHoareTripleChecker+Invalid, 4717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2637 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-14 06:09:58,616 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 4184 Invalid, 4717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2061 Invalid, 0 Unknown, 2637 Unchecked, 0.7s Time] [2022-07-14 06:09:58,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-14 06:09:58,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-07-14 06:09:58,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:58,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2022-07-14 06:09:58,618 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 157 [2022-07-14 06:09:58,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:09:58,618 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2022-07-14 06:09:58,618 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:09:58,618 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2022-07-14 06:09:58,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-14 06:09:58,618 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:09:58,618 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:09:58,633 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-14 06:09:58,819 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:09:58,819 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-14 06:09:58,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:09:58,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1522236517, now seen corresponding path program 24 times [2022-07-14 06:09:58,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:09:58,819 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715551291] [2022-07-14 06:09:58,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:09:58,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:09:58,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:10:00,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:10:00,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:10:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715551291] [2022-07-14 06:10:00,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715551291] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:10:00,949 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132794430] [2022-07-14 06:10:00,949 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-14 06:10:00,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:10:00,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:10:00,950 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-14 06:10:00,951 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-14 06:10:26,982 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-14 06:10:26,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-14 06:10:27,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 347 conjunts are in the unsatisfiable core [2022-07-14 06:10:27,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:10:27,048 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-14 06:10:28,286 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-14 06:10:28,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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-14 06:10:28,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-14 06:10:28,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:29,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:10:29,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:29,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:29,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:29,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:30,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:30,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:10:30,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-14 06:10:30,775 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:30,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 16 treesize of output 18 [2022-07-14 06:10:31,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:31,379 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-14 06:10:31,561 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-14 06:10:31,563 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:10:31,563 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-14 06:10:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:10:31,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:10:31,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-14 06:10:31,579 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:10:31,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2363) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-14 06:10:31,589 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,596 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2362) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,600 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,606 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2361) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:10:31,617 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2360) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-14 06:10:31,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,628 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2359) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2358) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2357) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:10:31,660 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2356) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-14 06:10:31,664 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2355) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:10:31,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2354) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-14 06:10:31,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:10:31,702 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2353) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-14 06:10:31,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-14 06:10:31,713 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2352) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-14 06:10:31,718 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-14 06:10:31,724 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2351) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-14 06:10:31,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,734 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2350) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,739 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 15)) 0)) is different from false [2022-07-14 06:10:31,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,745 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-14 06:10:31,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:10:31,748 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-14 06:10:31,752 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-14 06:10:31,752 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-14 06:10:31,754 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-14 06:10:33,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 689 not checked. [2022-07-14 06:10:33,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132794430] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:10:33,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:10:33,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 55, 55] total 172 [2022-07-14 06:10:33,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840048416] [2022-07-14 06:10:33,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:10:33,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2022-07-14 06:10:33,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:10:33,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2022-07-14 06:10:33,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=19037, Unknown=32, NotChecked=9824, Total=29412 [2022-07-14 06:10:33,037 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:37,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:10:37,597 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2022-07-14 06:10:37,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-07-14 06:10:37,598 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2022-07-14 06:10:37,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:10:37,598 INFO L225 Difference]: With dead ends: 272 [2022-07-14 06:10:37,598 INFO L226 Difference]: Without dead ends: 175 [2022-07-14 06:10:37,600 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 238 SyntacticMatches, 24 SemanticMatches, 205 ConstructedPredicates, 32 IntricatePredicates, 1 DeprecatedPredicates, 10185 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=755, Invalid=29791, Unknown=32, NotChecked=12064, Total=42642 [2022-07-14 06:10:37,600 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 68 mSDsluCounter, 4513 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 4579 SdHoareTripleChecker+Invalid, 8302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5062 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-14 06:10:37,600 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 4579 Invalid, 8302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3219 Invalid, 0 Unknown, 5062 Unchecked, 1.0s Time] [2022-07-14 06:10:37,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-14 06:10:37,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-14 06:10:37,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0116959064327486) internal successors, (173), 171 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:37,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2022-07-14 06:10:37,602 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2022-07-14 06:10:37,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:10:37,602 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2022-07-14 06:10:37,603 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2022-07-14 06:10:37,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-14 06:10:37,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:10:37,603 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:10:37,620 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-14 06:10:37,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-14 06:10:37,813 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:10:37,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:10:37,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1872595624, now seen corresponding path program 25 times [2022-07-14 06:10:37,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:10:37,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043067315] [2022-07-14 06:10:37,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:10:37,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 06:10:37,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:10:38,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 378 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:10:38,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 06:10:38,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043067315] [2022-07-14 06:10:38,516 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043067315] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 06:10:38,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [595234691] [2022-07-14 06:10:38,516 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-14 06:10:38,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 06:10:38,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 06:10:38,517 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-14 06:10:38,518 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-14 06:10:38,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 06:10:38,729 INFO L263 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-14 06:10:38,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 06:10:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:10:39,451 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-14 06:10:40,356 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-14 06:10:40,431 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-14 06:10:40,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [595234691] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-14 06:10:40,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-14 06:10:40,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 81 [2022-07-14 06:10:40,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1770756226] [2022-07-14 06:10:40,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-14 06:10:40,432 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-14 06:10:40,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 06:10:40,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-14 06:10:40,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=5932, Unknown=0, NotChecked=0, Total=6642 [2022-07-14 06:10:40,433 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:42,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 06:10:42,675 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2022-07-14 06:10:42,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-14 06:10:42,676 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-07-14 06:10:42,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 06:10:42,676 INFO L225 Difference]: With dead ends: 180 [2022-07-14 06:10:42,677 INFO L226 Difference]: Without dead ends: 180 [2022-07-14 06:10:42,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2675, Invalid=11367, Unknown=0, NotChecked=0, Total=14042 [2022-07-14 06:10:42,678 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1074 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-14 06:10:42,678 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1947 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-14 06:10:42,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-14 06:10:42,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-07-14 06:10:42,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.0112994350282485) internal successors, (179), 177 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:42,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2022-07-14 06:10:42,680 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 171 [2022-07-14 06:10:42,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 06:10:42,681 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2022-07-14 06:10:42,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-14 06:10:42,681 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2022-07-14 06:10:42,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-14 06:10:42,681 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 06:10:42,681 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 06:10:42,699 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-07-14 06:10:42,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-14 06:10:42,895 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-14 06:10:42,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 06:10:42,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1129781606, now seen corresponding path program 26 times [2022-07-14 06:10:42,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 06:10:42,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447047040] [2022-07-14 06:10:42,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 06:10:42,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms