./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-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 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 05:23:47,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 05:23:47,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 05:23:47,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 05:23:47,049 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 05:23:47,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 05:23:47,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 05:23:47,053 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 05:23:47,055 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 05:23:47,058 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 05:23:47,059 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 05:23:47,060 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 05:23:47,061 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 05:23:47,062 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 05:23:47,063 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 05:23:47,065 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 05:23:47,066 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 05:23:47,067 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 05:23:47,068 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 05:23:47,072 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 05:23:47,073 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 05:23:47,074 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 05:23:47,075 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 05:23:47,075 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 05:23:47,076 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 05:23:47,081 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 05:23:47,082 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 05:23:47,082 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 05:23:47,083 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 05:23:47,083 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 05:23:47,084 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 05:23:47,084 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 05:23:47,085 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 05:23:47,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 05:23:47,086 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 05:23:47,087 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 05:23:47,087 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 05:23:47,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 05:23:47,088 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 05:23:47,088 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 05:23:47,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 05:23:47,090 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 05:23:47,091 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 05:23:47,113 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 05:23:47,114 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 05:23:47,114 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 05:23:47,114 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 05:23:47,115 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 05:23:47,115 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 05:23:47,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 05:23:47,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 05:23:47,115 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 05:23:47,116 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 05:23:47,116 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 05:23:47,116 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 05:23:47,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 05:23:47,118 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 05:23:47,118 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 05:23:47,118 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 05:23:47,118 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 05:23:47,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 05:23:47,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:47,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 05:23:47,119 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 05:23:47,119 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 05:23:47,119 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 05:23:47,119 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 -> 4b6873ae1a0d665798beb3dd9c0c48e89806da7dd46f1d2066800a52e0a2aa51 [2022-07-20 05:23:47,318 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 05:23:47,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 05:23:47,341 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 05:23:47,342 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 05:23:47,342 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 05:23:47,343 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-20 05:23:47,402 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24953c4d0/97ed6e9b9e994aca90ee0bfe06cb3eca/FLAGfd7e77cb2 [2022-07-20 05:23:47,714 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 05:23:47,714 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrcpy-alloca-2.i [2022-07-20 05:23:47,723 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24953c4d0/97ed6e9b9e994aca90ee0bfe06cb3eca/FLAGfd7e77cb2 [2022-07-20 05:23:48,129 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24953c4d0/97ed6e9b9e994aca90ee0bfe06cb3eca [2022-07-20 05:23:48,131 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 05:23:48,132 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 05:23:48,133 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:48,133 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 05:23:48,149 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 05:23:48,149 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,150 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@170f9594 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48, skipping insertion in model container [2022-07-20 05:23:48,150 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,154 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 05:23:48,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 05:23:48,379 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:48,384 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 05:23:48,426 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 05:23:48,442 INFO L208 MainTranslator]: Completed translation [2022-07-20 05:23:48,442 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48 WrapperNode [2022-07-20 05:23:48,442 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 05:23:48,443 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:48,443 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 05:23:48,444 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 05:23:48,448 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,462 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,475 INFO L137 Inliner]: procedures = 117, calls = 13, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-07-20 05:23:48,475 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 05:23:48,475 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 05:23:48,476 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 05:23:48,476 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 05:23:48,481 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,481 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,484 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,486 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,490 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,494 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,495 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,496 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 05:23:48,497 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 05:23:48,497 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 05:23:48,497 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 05:23:48,498 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (1/1) ... [2022-07-20 05:23:48,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 05:23:48,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:48,528 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-20 05:23:48,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-20 05:23:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 05:23:48,553 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 05:23:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 05:23:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 05:23:48,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 05:23:48,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 05:23:48,613 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 05:23:48,614 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 05:23:48,734 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 05:23:48,739 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 05:23:48,741 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-07-20 05:23:48,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:48 BoogieIcfgContainer [2022-07-20 05:23:48,743 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 05:23:48,744 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 05:23:48,759 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 05:23:48,762 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 05:23:48,762 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 05:23:48" (1/3) ... [2022-07-20 05:23:48,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bfaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:48, skipping insertion in model container [2022-07-20 05:23:48,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 05:23:48" (2/3) ... [2022-07-20 05:23:48,763 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67bfaf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 05:23:48, skipping insertion in model container [2022-07-20 05:23:48,763 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 05:23:48" (3/3) ... [2022-07-20 05:23:48,764 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcpy-alloca-2.i [2022-07-20 05:23:48,774 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 05:23:48,786 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2022-07-20 05:23:48,827 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 05:23:48,831 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@54621bc0, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@485e0712 [2022-07-20 05:23:48,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2022-07-20 05:23:48,835 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:48,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:23:48,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:48,840 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:23:48,840 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:48,844 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:48,844 INFO L85 PathProgramCache]: Analyzing trace with hash 889510840, now seen corresponding path program 1 times [2022-07-20 05:23:48,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:48,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652738159] [2022-07-20 05:23:48,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:48,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:48,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:48,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:48,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:48,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652738159] [2022-07-20 05:23:48,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652738159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:48,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:48,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:48,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810418305] [2022-07-20 05:23:48,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:48,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:48,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,018 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.8421052631578947) internal successors, (35), 28 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,050 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-20 05:23:49,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:23:49,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,057 INFO L225 Difference]: With dead ends: 34 [2022-07-20 05:23:49,058 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:23:49,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,061 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 56 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 35 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:23:49,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-07-20 05:23:49,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.6842105263157894) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 05:23:49,091 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 6 [2022-07-20 05:23:49,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,091 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 05:23:49,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 05:23:49,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 05:23:49,092 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,092 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 05:23:49,092 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,093 INFO L85 PathProgramCache]: Analyzing trace with hash 889512762, now seen corresponding path program 1 times [2022-07-20 05:23:49,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172988220] [2022-07-20 05:23:49,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,130 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172988220] [2022-07-20 05:23:49,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172988220] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:49,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250552008] [2022-07-20 05:23:49,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:49,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:49,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:49,134 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,169 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-07-20 05:23:49,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:49,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 05:23:49,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,170 INFO L225 Difference]: With dead ends: 29 [2022-07-20 05:23:49,170 INFO L226 Difference]: Without dead ends: 28 [2022-07-20 05:23:49,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:49,171 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 2 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 43 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-07-20 05:23:49,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-07-20 05:23:49,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.6666666666666667) internal successors, (30), 26 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-20 05:23:49,175 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-20 05:23:49,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,175 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-20 05:23:49,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,176 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-20 05:23:49,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:49,176 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 05:23:49,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,178 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033015, now seen corresponding path program 1 times [2022-07-20 05:23:49,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642712445] [2022-07-20 05:23:49,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,211 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642712445] [2022-07-20 05:23:49,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642712445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,212 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 05:23:49,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886030751] [2022-07-20 05:23:49,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 05:23:49,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 05:23:49,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:49,214 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,230 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-07-20 05:23:49,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 05:23:49,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:23:49,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,231 INFO L225 Difference]: With dead ends: 25 [2022-07-20 05:23:49,231 INFO L226 Difference]: Without dead ends: 25 [2022-07-20 05:23:49,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 05:23:49,232 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 22 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-20 05:23:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-07-20 05:23:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 24 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-07-20 05:23:49,236 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 7 [2022-07-20 05:23:49,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,236 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-07-20 05:23:49,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,236 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-07-20 05:23:49,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:49,237 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,237 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 05:23:49,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,238 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033016, now seen corresponding path program 1 times [2022-07-20 05:23:49,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402006287] [2022-07-20 05:23:49,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,285 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402006287] [2022-07-20 05:23:49,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402006287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,286 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,286 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:49,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968871281] [2022-07-20 05:23:49,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,287 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:49,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,288 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,304 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-20 05:23:49,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,304 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:23:49,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,305 INFO L225 Difference]: With dead ends: 24 [2022-07-20 05:23:49,305 INFO L226 Difference]: Without dead ends: 24 [2022-07-20 05:23:49,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,306 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 40 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 19 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-20 05:23:49,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-20 05:23:49,308 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.5) internal successors, (27), 23 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-20 05:23:49,309 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 7 [2022-07-20 05:23:49,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,309 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-20 05:23:49,309 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-20 05:23:49,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:49,310 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,310 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,310 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 05:23:49,311 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1805033069, now seen corresponding path program 1 times [2022-07-20 05:23:49,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093955388] [2022-07-20 05:23:49,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093955388] [2022-07-20 05:23:49,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093955388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:49,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010095645] [2022-07-20 05:23:49,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:49,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,344 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,368 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2022-07-20 05:23:49,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,369 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:23:49,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,370 INFO L225 Difference]: With dead ends: 40 [2022-07-20 05:23:49,370 INFO L226 Difference]: Without dead ends: 40 [2022-07-20 05:23:49,370 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,371 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 31 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 44 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-07-20 05:23:49,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 26. [2022-07-20 05:23:49,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.45) internal successors, (29), 25 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-20 05:23:49,388 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 7 [2022-07-20 05:23:49,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,389 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-20 05:23:49,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,389 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-20 05:23:49,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 05:23:49,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,390 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 05:23:49,390 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1805092651, now seen corresponding path program 1 times [2022-07-20 05:23:49,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [637707378] [2022-07-20 05:23:49,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [637707378] [2022-07-20 05:23:49,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [637707378] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:49,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920146667] [2022-07-20 05:23:49,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:49,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,445 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,489 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-20 05:23:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,489 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 05:23:49,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,490 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:23:49,490 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:23:49,491 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,491 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 56 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 33 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:23:49,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 28. [2022-07-20 05:23:49,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.4545454545454546) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 05:23:49,496 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 7 [2022-07-20 05:23:49,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,496 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 05:23:49,496 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,496 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 05:23:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:23:49,497 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,497 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 05:23:49,497 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,497 INFO L85 PathProgramCache]: Analyzing trace with hash -530059845, now seen corresponding path program 1 times [2022-07-20 05:23:49,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052660019] [2022-07-20 05:23:49,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052660019] [2022-07-20 05:23:49,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052660019] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:49,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1015019140] [2022-07-20 05:23:49,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:49,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,524 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,545 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-20 05:23:49,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,546 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 05:23:49,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,546 INFO L225 Difference]: With dead ends: 27 [2022-07-20 05:23:49,547 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 05:23:49,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,550 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 23 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 05:23:49,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 05:23:49,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 26 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-20 05:23:49,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 05:23:49,554 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 9 [2022-07-20 05:23:49,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,554 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 05:23:49,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,555 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 05:23:49,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 05:23:49,555 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,555 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 05:23:49,555 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,556 INFO L85 PathProgramCache]: Analyzing trace with hash -530059844, now seen corresponding path program 1 times [2022-07-20 05:23:49,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,556 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002389314] [2022-07-20 05:23:49,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,631 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002389314] [2022-07-20 05:23:49,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002389314] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 05:23:49,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765329898] [2022-07-20 05:23:49,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 05:23:49,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,633 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 05:23:49,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:23:49,633 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,671 INFO L93 Difference]: Finished difference Result 37 states and 41 transitions. [2022-07-20 05:23:49,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:49,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-07-20 05:23:49,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,672 INFO L225 Difference]: With dead ends: 37 [2022-07-20 05:23:49,672 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 05:23:49,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-20 05:23:49,673 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 92 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 36 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 05:23:49,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-07-20 05:23:49,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.391304347826087) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 05:23:49,675 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 9 [2022-07-20 05:23:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,675 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 05:23:49,676 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,676 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 05:23:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:23:49,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,676 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,676 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 05:23:49,677 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,677 INFO L85 PathProgramCache]: Analyzing trace with hash 748014006, now seen corresponding path program 1 times [2022-07-20 05:23:49,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134873061] [2022-07-20 05:23:49,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134873061] [2022-07-20 05:23:49,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134873061] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,721 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,721 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:49,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548319163] [2022-07-20 05:23:49,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,721 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:49,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:49,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,723 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,741 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-07-20 05:23:49,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:23:49,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,742 INFO L225 Difference]: With dead ends: 27 [2022-07-20 05:23:49,742 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 05:23:49,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 05:23:49,743 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 34 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 30 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 05:23:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 05:23:49,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 26 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-20 05:23:49,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-07-20 05:23:49,747 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 10 [2022-07-20 05:23:49,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,748 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-07-20 05:23:49,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,748 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-07-20 05:23:49,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 05:23:49,749 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,749 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 05:23:49,749 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,750 INFO L85 PathProgramCache]: Analyzing trace with hash 748014007, now seen corresponding path program 1 times [2022-07-20 05:23:49,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1221559459] [2022-07-20 05:23:49,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,795 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1221559459] [2022-07-20 05:23:49,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1221559459] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:49,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448155088] [2022-07-20 05:23:49,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 05:23:49,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 05:23:49,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,796 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,837 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-07-20 05:23:49,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 05:23:49,837 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 05:23:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,838 INFO L225 Difference]: With dead ends: 34 [2022-07-20 05:23:49,838 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 05:23:49,838 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:49,838 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 56 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,839 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 36 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 05:23:49,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2022-07-20 05:23:49,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 27 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-07-20 05:23:49,843 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2022-07-20 05:23:49,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,843 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-07-20 05:23:49,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,843 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-07-20 05:23:49,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:23:49,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,844 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 05:23:49,844 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,845 INFO L85 PathProgramCache]: Analyzing trace with hash 952918382, now seen corresponding path program 1 times [2022-07-20 05:23:49,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027513083] [2022-07-20 05:23:49,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 05:23:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027513083] [2022-07-20 05:23:49,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027513083] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:49,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:49,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 05:23:49,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335810573] [2022-07-20 05:23:49,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:49,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:49,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:49,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:49,873 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:49,890 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2022-07-20 05:23:49,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:49,890 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:23:49,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:49,891 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:23:49,891 INFO L226 Difference]: Without dead ends: 47 [2022-07-20 05:23:49,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 05:23:49,891 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 28 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:49,891 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 58 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:49,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-20 05:23:49,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 29. [2022-07-20 05:23:49,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.36) internal successors, (34), 28 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-07-20 05:23:49,893 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 11 [2022-07-20 05:23:49,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:49,894 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-07-20 05:23:49,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:49,894 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-07-20 05:23:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 05:23:49,894 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:49,894 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:49,894 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 05:23:49,894 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:49,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:49,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1632976752, now seen corresponding path program 1 times [2022-07-20 05:23:49,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:49,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199766928] [2022-07-20 05:23:49,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:49,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:49,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:49,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199766928] [2022-07-20 05:23:49,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199766928] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:49,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1456090407] [2022-07-20 05:23:49,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:49,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:49,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:49,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:49,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-20 05:23:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-20 05:23:50,016 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:50,142 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:50,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:23:50,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:50,209 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:50,295 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:50,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1456090407] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:50,296 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:50,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-20 05:23:50,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160204948] [2022-07-20 05:23:50,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 05:23:50,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 05:23:50,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-20 05:23:50,297 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,389 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-07-20 05:23:50,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:50,389 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-20 05:23:50,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,390 INFO L225 Difference]: With dead ends: 59 [2022-07-20 05:23:50,390 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:23:50,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-20 05:23:50,391 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 86 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 86 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:50,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:23:50,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 26. [2022-07-20 05:23:50,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-07-20 05:23:50,393 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 11 [2022-07-20 05:23:50,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,393 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-07-20 05:23:50,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,393 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-07-20 05:23:50,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:50,394 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:50,411 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-20 05:23:50,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-20 05:23:50,607 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:50,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1794944983, now seen corresponding path program 1 times [2022-07-20 05:23:50,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604346026] [2022-07-20 05:23:50,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:50,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:50,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604346026] [2022-07-20 05:23:50,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604346026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:50,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:50,672 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:23:50,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296681456] [2022-07-20 05:23:50,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:23:50,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:23:50,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:50,673 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,717 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2022-07-20 05:23:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,717 INFO L225 Difference]: With dead ends: 37 [2022-07-20 05:23:50,718 INFO L226 Difference]: Without dead ends: 37 [2022-07-20 05:23:50,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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-20 05:23:50,718 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 81 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:50,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-20 05:23:50,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 33. [2022-07-20 05:23:50,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 30 states have (on average 1.2333333333333334) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-20 05:23:50,720 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2022-07-20 05:23:50,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,720 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-20 05:23:50,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,721 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-20 05:23:50,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:50,735 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,735 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:50,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 05:23:50,735 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:50,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1401917973, now seen corresponding path program 1 times [2022-07-20 05:23:50,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,736 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945060483] [2022-07-20 05:23:50,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,795 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:50,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:50,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945060483] [2022-07-20 05:23:50,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945060483] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:50,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:50,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:23:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074940979] [2022-07-20 05:23:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:23:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:23:50,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:50,798 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:50,869 INFO L93 Difference]: Finished difference Result 49 states and 52 transitions. [2022-07-20 05:23:50,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:50,870 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:50,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:50,870 INFO L225 Difference]: With dead ends: 49 [2022-07-20 05:23:50,870 INFO L226 Difference]: Without dead ends: 49 [2022-07-20 05:23:50,871 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:23:50,871 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:50,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 99 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:50,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-20 05:23:50,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 31. [2022-07-20 05:23:50,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2022-07-20 05:23:50,873 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 13 [2022-07-20 05:23:50,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:50,874 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2022-07-20 05:23:50,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:50,874 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-07-20 05:23:50,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 05:23:50,874 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:50,874 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:50,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 05:23:50,875 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:50,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:50,875 INFO L85 PathProgramCache]: Analyzing trace with hash 2102982551, now seen corresponding path program 1 times [2022-07-20 05:23:50,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:50,875 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1903262944] [2022-07-20 05:23:50,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:50,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:50,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:50,936 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:50,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:50,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1903262944] [2022-07-20 05:23:50,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1903262944] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:50,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:50,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 05:23:50,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74033308] [2022-07-20 05:23:50,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:50,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 05:23:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:50,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 05:23:50,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 05:23:50,938 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:51,080 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-07-20 05:23:51,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 05:23:51,080 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 05:23:51,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:51,080 INFO L225 Difference]: With dead ends: 44 [2022-07-20 05:23:51,080 INFO L226 Difference]: Without dead ends: 44 [2022-07-20 05:23:51,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-20 05:23:51,081 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:51,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 85 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:51,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-20 05:23:51,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-07-20 05:23:51,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-07-20 05:23:51,082 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 13 [2022-07-20 05:23:51,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:51,083 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-07-20 05:23:51,083 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,083 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-07-20 05:23:51,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 05:23:51,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:51,083 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:51,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 05:23:51,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:51,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:51,083 INFO L85 PathProgramCache]: Analyzing trace with hash -191335553, now seen corresponding path program 1 times [2022-07-20 05:23:51,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:51,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782991671] [2022-07-20 05:23:51,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:51,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [782991671] [2022-07-20 05:23:51,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [782991671] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 05:23:51,114 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 05:23:51,114 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 05:23:51,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859278560] [2022-07-20 05:23:51,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 05:23:51,115 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 05:23:51,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:51,115 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 05:23:51,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:51,115 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:51,125 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-07-20 05:23:51,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 05:23:51,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 05:23:51,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:51,125 INFO L225 Difference]: With dead ends: 31 [2022-07-20 05:23:51,125 INFO L226 Difference]: Without dead ends: 20 [2022-07-20 05:23:51,126 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 05:23:51,126 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 10 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:51,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 32 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 05:23:51,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-20 05:23:51,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-20 05:23:51,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 19 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2022-07-20 05:23:51,127 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2022-07-20 05:23:51,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:51,128 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2022-07-20 05:23:51,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,128 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2022-07-20 05:23:51,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 05:23:51,128 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:51,128 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:51,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 05:23:51,129 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:51,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:51,129 INFO L85 PathProgramCache]: Analyzing trace with hash 70337178, now seen corresponding path program 1 times [2022-07-20 05:23:51,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:51,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888061826] [2022-07-20 05:23:51,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:51,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:51,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888061826] [2022-07-20 05:23:51,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888061826] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:51,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032607102] [2022-07-20 05:23:51,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:51,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:51,196 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:51,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 05:23:51,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-20 05:23:51,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,297 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:51,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:23:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032607102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:51,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:51,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2022-07-20 05:23:51,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939530392] [2022-07-20 05:23:51,378 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:51,378 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-20 05:23:51,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:51,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-20 05:23:51,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-07-20 05:23:51,379 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:51,472 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2022-07-20 05:23:51,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:23:51,472 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 05:23:51,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:51,473 INFO L225 Difference]: With dead ends: 30 [2022-07-20 05:23:51,473 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 05:23:51,473 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:23:51,473 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:51,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 45 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:51,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 05:23:51,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 23. [2022-07-20 05:23:51,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 21 states have (on average 1.1428571428571428) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-20 05:23:51,475 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 17 [2022-07-20 05:23:51,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:51,475 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-20 05:23:51,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.25) internal successors, (36), 17 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:51,476 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-20 05:23:51,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 05:23:51,476 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:51,476 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:51,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:51,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 05:23:51,693 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -2114514791, now seen corresponding path program 1 times [2022-07-20 05:23:51,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:51,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189202245] [2022-07-20 05:23:51,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:51,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:51,747 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189202245] [2022-07-20 05:23:51,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189202245] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:51,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771283769] [2022-07-20 05:23:51,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:51,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:51,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:51,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:51,765 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 05:23:51,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:51,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-20 05:23:51,823 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:51,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:51,834 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:23:51,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:51,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:51,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:52,011 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:52,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771283769] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:52,012 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:52,012 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 15 [2022-07-20 05:23:52,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335901373] [2022-07-20 05:23:52,012 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:52,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-20 05:23:52,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:52,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-20 05:23:52,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-07-20 05:23:52,013 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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-20 05:23:52,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:52,167 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-07-20 05:23:52,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 05:23:52,168 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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) Word has length 18 [2022-07-20 05:23:52,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:52,168 INFO L225 Difference]: With dead ends: 29 [2022-07-20 05:23:52,168 INFO L226 Difference]: Without dead ends: 29 [2022-07-20 05:23:52,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:23:52,169 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 51 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:52,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 48 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:52,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-07-20 05:23:52,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2022-07-20 05:23:52,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:52,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-20 05:23:52,170 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2022-07-20 05:23:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:52,170 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-20 05:23:52,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.0) internal successors, (45), 16 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-20 05:23:52,170 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-20 05:23:52,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 05:23:52,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:52,170 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:52,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:52,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-20 05:23:52,371 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:52,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:52,371 INFO L85 PathProgramCache]: Analyzing trace with hash 775185845, now seen corresponding path program 2 times [2022-07-20 05:23:52,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:52,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049749685] [2022-07-20 05:23:52,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:52,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:52,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:52,541 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:52,541 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:52,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049749685] [2022-07-20 05:23:52,542 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049749685] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:52,542 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013139066] [2022-07-20 05:23:52,542 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:23:52,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:52,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:52,543 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:52,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 05:23:52,592 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:23:52,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:52,593 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 05:23:52,594 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:52,599 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:52,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:23:52,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:23:52,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:52,808 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 05:23:52,922 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:52,923 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:53,172 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_16| Int) (v_ArrVal_188 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_16|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_188) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_16| 1)) 0) (<= (+ |v_ULTIMATE.start_cstrcpy_~from#1.offset_16| 3) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-20 05:23:53,183 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:53,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:23:53,189 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:53,189 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:23:53,193 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:23:53,196 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:23:53,302 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:53,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013139066] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:53,302 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:53,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-20 05:23:53,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924125189] [2022-07-20 05:23:53,303 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:53,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:23:53,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:53,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:23:53,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=769, Unknown=2, NotChecked=56, Total=930 [2022-07-20 05:23:53,304 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:53,732 INFO L93 Difference]: Finished difference Result 47 states and 48 transitions. [2022-07-20 05:23:53,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:23:53,732 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 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) Word has length 21 [2022-07-20 05:23:53,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:53,732 INFO L225 Difference]: With dead ends: 47 [2022-07-20 05:23:53,732 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 05:23:53,734 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=202, Invalid=1440, Unknown=2, NotChecked=78, Total=1722 [2022-07-20 05:23:53,734 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 33 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 67 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:53,734 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 114 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 203 Invalid, 0 Unknown, 67 Unchecked, 0.1s Time] [2022-07-20 05:23:53,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 05:23:53,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-07-20 05:23:53,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 29 states have (on average 1.103448275862069) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-20 05:23:53,741 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 21 [2022-07-20 05:23:53,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:53,742 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-20 05:23:53,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 1.7741935483870968) internal successors, (55), 31 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:53,742 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-20 05:23:53,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 05:23:53,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:53,743 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:53,762 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:53,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:53,960 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:53,961 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:53,961 INFO L85 PathProgramCache]: Analyzing trace with hash -1518290629, now seen corresponding path program 2 times [2022-07-20 05:23:53,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:53,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989115977] [2022-07-20 05:23:53,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:53,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:53,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:54,067 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:54,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989115977] [2022-07-20 05:23:54,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989115977] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:54,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676599543] [2022-07-20 05:23:54,067 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:23:54,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:54,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:54,069 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:54,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 05:23:54,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:23:54,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:54,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 05:23:54,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:54,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:23:54,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:23:54,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:54,237 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:54,387 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676599543] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:54,387 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:54,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2022-07-20 05:23:54,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725440409] [2022-07-20 05:23:54,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:54,389 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 05:23:54,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:54,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 05:23:54,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2022-07-20 05:23:54,390 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-20 05:23:54,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:54,566 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2022-07-20 05:23:54,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 05:23:54,567 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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) Word has length 26 [2022-07-20 05:23:54,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:54,567 INFO L225 Difference]: With dead ends: 34 [2022-07-20 05:23:54,567 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 05:23:54,568 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 37 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=547, Unknown=0, NotChecked=0, Total=702 [2022-07-20 05:23:54,569 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 86 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:54,569 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 50 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:54,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 05:23:54,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2022-07-20 05:23:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 30 states have (on average 1.1) internal successors, (33), 31 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:54,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 33 transitions. [2022-07-20 05:23:54,574 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 33 transitions. Word has length 26 [2022-07-20 05:23:54,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:54,575 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 33 transitions. [2022-07-20 05:23:54,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 3.45) internal successors, (69), 21 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-20 05:23:54,575 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 33 transitions. [2022-07-20 05:23:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 05:23:54,578 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:54,578 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:54,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:54,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:54,795 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:54,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:54,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1095540269, now seen corresponding path program 3 times [2022-07-20 05:23:54,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:54,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169219172] [2022-07-20 05:23:54,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:54,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:54,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:54,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:54,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169219172] [2022-07-20 05:23:54,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169219172] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:54,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876474898] [2022-07-20 05:23:54,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:23:54,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:54,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:54,931 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:54,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 05:23:55,000 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:23:55,000 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:55,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:23:55,003 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:55,015 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:55,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:23:55,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-20 05:23:55,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:23:55,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 05:23:55,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:55,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 10 [2022-07-20 05:23:55,312 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:55,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:55,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:23:55,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_261) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:23:55,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_261) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:23:55,349 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:55,349 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:23:55,353 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:55,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:23:55,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 11 treesize of output 7 [2022-07-20 05:23:55,483 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-20 05:23:55,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876474898] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:55,483 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:55,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 31 [2022-07-20 05:23:55,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1437467543] [2022-07-20 05:23:55,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:55,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 05:23:55,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:55,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 05:23:55,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=668, Unknown=3, NotChecked=162, Total=930 [2022-07-20 05:23:55,485 INFO L87 Difference]: Start difference. First operand 32 states and 33 transitions. Second operand has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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-20 05:23:55,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:55,667 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-20 05:23:55,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 05:23:55,667 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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) Word has length 29 [2022-07-20 05:23:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:55,668 INFO L225 Difference]: With dead ends: 52 [2022-07-20 05:23:55,668 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 05:23:55,668 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=129, Invalid=872, Unknown=3, NotChecked=186, Total=1190 [2022-07-20 05:23:55,669 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 21 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:55,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 166 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 155 Invalid, 0 Unknown, 72 Unchecked, 0.1s Time] [2022-07-20 05:23:55,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 05:23:55,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2022-07-20 05:23:55,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.088235294117647) internal successors, (37), 35 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:55,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2022-07-20 05:23:55,670 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 29 [2022-07-20 05:23:55,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:55,670 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2022-07-20 05:23:55,670 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 31 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-20 05:23:55,670 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2022-07-20 05:23:55,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 05:23:55,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:55,671 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:55,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:55,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:55,885 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:55,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:55,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1267943126, now seen corresponding path program 4 times [2022-07-20 05:23:55,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:55,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634636475] [2022-07-20 05:23:55,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:55,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:55,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:55,987 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:55,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634636475] [2022-07-20 05:23:55,988 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634636475] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:55,988 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349705118] [2022-07-20 05:23:55,988 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:23:55,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:55,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:55,989 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:56,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 05:23:56,061 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:23:56,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:56,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 05:23:56,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:56,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:56,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:23:56,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:23:56,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:56,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:23:56,293 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:56,293 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-20 05:23:56,347 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 8 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:56,348 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:56,674 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:56,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:23:56,679 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:23:56,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:23:56,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:23:56,903 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 15 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:56,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349705118] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:56,904 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:56,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13, 14] total 35 [2022-07-20 05:23:56,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626867514] [2022-07-20 05:23:56,904 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:56,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 05:23:56,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:56,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 05:23:56,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1098, Unknown=1, NotChecked=0, Total=1260 [2022-07-20 05:23:56,905 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:57,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:57,561 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2022-07-20 05:23:57,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:23:57,561 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-07-20 05:23:57,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:57,561 INFO L225 Difference]: With dead ends: 48 [2022-07-20 05:23:57,561 INFO L226 Difference]: Without dead ends: 48 [2022-07-20 05:23:57,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=389, Invalid=2055, Unknown=6, NotChecked=0, Total=2450 [2022-07-20 05:23:57,562 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 80 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 426 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:57,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 186 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 426 Invalid, 0 Unknown, 106 Unchecked, 0.2s Time] [2022-07-20 05:23:57,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-20 05:23:57,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 43. [2022-07-20 05:23:57,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0975609756097562) internal successors, (45), 42 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-20 05:23:57,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 45 transitions. [2022-07-20 05:23:57,564 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 45 transitions. Word has length 33 [2022-07-20 05:23:57,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:57,564 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 45 transitions. [2022-07-20 05:23:57,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.6) internal successors, (91), 36 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:57,564 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 45 transitions. [2022-07-20 05:23:57,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 05:23:57,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:57,564 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:57,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-20 05:23:57,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:57,765 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:57,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:57,765 INFO L85 PathProgramCache]: Analyzing trace with hash 651531229, now seen corresponding path program 3 times [2022-07-20 05:23:57,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:57,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357297930] [2022-07-20 05:23:57,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:57,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:57,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:57,864 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:57,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357297930] [2022-07-20 05:23:57,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357297930] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:57,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1192520189] [2022-07-20 05:23:57,865 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:23:57,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:57,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:57,866 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:57,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 05:23:57,932 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-20 05:23:57,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:57,933 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 47 conjunts are in the unsatisfiable core [2022-07-20 05:23:57,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:57,946 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:57,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:23:57,954 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:23:58,161 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:58,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:58,371 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:58,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1192520189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:58,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:58,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2022-07-20 05:23:58,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706097835] [2022-07-20 05:23:58,372 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:58,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:23:58,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:58,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:23:58,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=642, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:23:58,373 INFO L87 Difference]: Start difference. First operand 43 states and 45 transitions. Second operand has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:58,702 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-20 05:23:58,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 05:23:58,703 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-20 05:23:58,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:58,703 INFO L225 Difference]: With dead ends: 43 [2022-07-20 05:23:58,703 INFO L226 Difference]: Without dead ends: 43 [2022-07-20 05:23:58,704 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1066, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:23:58,704 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:58,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 103 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:58,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-20 05:23:58,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-20 05:23:58,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 41 states have (on average 1.0731707317073171) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-20 05:23:58,706 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-20 05:23:58,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:58,706 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-20 05:23:58,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 3.4814814814814814) internal successors, (94), 28 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:58,706 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-20 05:23:58,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 05:23:58,707 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:58,707 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:58,725 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-20 05:23:58,923 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,SelfDestructingSolverStorable22 [2022-07-20 05:23:58,924 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:58,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:58,924 INFO L85 PathProgramCache]: Analyzing trace with hash -671378910, now seen corresponding path program 4 times [2022-07-20 05:23:58,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:58,924 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171727089] [2022-07-20 05:23:58,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:58,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:23:58,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:23:59,055 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:59,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:23:59,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171727089] [2022-07-20 05:23:59,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171727089] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:23:59,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1927221245] [2022-07-20 05:23:59,056 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:23:59,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:23:59,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:23:59,057 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:23:59,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 05:23:59,129 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:23:59,129 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:23:59,130 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 05:23:59,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:23:59,147 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:23:59,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:23:59,378 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:59,379 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:23:59,519 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 28 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:23:59,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1927221245] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:23:59,519 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:23:59,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 13] total 28 [2022-07-20 05:23:59,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361818961] [2022-07-20 05:23:59,520 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:23:59,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 05:23:59,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:23:59,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 05:23:59,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-07-20 05:23:59,521 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-20 05:23:59,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:23:59,785 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-07-20 05:23:59,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:23:59,785 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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) Word has length 38 [2022-07-20 05:23:59,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:23:59,786 INFO L225 Difference]: With dead ends: 69 [2022-07-20 05:23:59,786 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 05:23:59,786 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 273 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=290, Invalid=1042, Unknown=0, NotChecked=0, Total=1332 [2022-07-20 05:23:59,787 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 73 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:23:59,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 88 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:23:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 05:23:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-20 05:23:59,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 45 states have (on average 1.0666666666666667) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:23:59,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-20 05:23:59,788 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 38 [2022-07-20 05:23:59,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:23:59,788 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-20 05:23:59,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 3.1785714285714284) internal successors, (89), 28 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-20 05:23:59,788 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-20 05:23:59,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-20 05:23:59,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:23:59,788 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:23:59,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 05:23:59,988 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,SelfDestructingSolverStorable23 [2022-07-20 05:23:59,989 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:23:59,989 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:23:59,989 INFO L85 PathProgramCache]: Analyzing trace with hash -452353921, now seen corresponding path program 5 times [2022-07-20 05:23:59,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:23:59,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240640105] [2022-07-20 05:23:59,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:23:59,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:00,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:00,135 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 6 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:00,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240640105] [2022-07-20 05:24:00,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240640105] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:00,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [976610457] [2022-07-20 05:24:00,136 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:00,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:00,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:00,137 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:00,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 05:24:00,227 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-20 05:24:00,228 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:00,229 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 05:24:00,231 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:00,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:00,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:24:00,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 15 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:00,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:00,796 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 28 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:00,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [976610457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:00,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:00,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 32 [2022-07-20 05:24:00,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56493705] [2022-07-20 05:24:00,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:00,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:24:00,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:00,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:24:00,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=909, Unknown=0, NotChecked=0, Total=1056 [2022-07-20 05:24:00,798 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:01,148 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2022-07-20 05:24:01,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 05:24:01,148 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-20 05:24:01,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:01,149 INFO L225 Difference]: With dead ends: 50 [2022-07-20 05:24:01,149 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 05:24:01,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=1455, Unknown=0, NotChecked=0, Total=1806 [2022-07-20 05:24:01,150 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 137 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:01,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 135 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 05:24:01,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 05:24:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2022-07-20 05:24:01,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.065217391304348) internal successors, (49), 47 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2022-07-20 05:24:01,151 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 42 [2022-07-20 05:24:01,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:01,151 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2022-07-20 05:24:01,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.65625) internal successors, (117), 33 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:01,151 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2022-07-20 05:24:01,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-07-20 05:24:01,151 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:01,151 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:01,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:01,352 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,SelfDestructingSolverStorable24 [2022-07-20 05:24:01,352 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:01,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:01,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1531708431, now seen corresponding path program 5 times [2022-07-20 05:24:01,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:01,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780458412] [2022-07-20 05:24:01,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:01,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:01,532 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:01,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780458412] [2022-07-20 05:24:01,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780458412] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:01,532 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491450252] [2022-07-20 05:24:01,532 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:01,533 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:01,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:01,534 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:01,535 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 05:24:01,646 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-20 05:24:01,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:01,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 252 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-20 05:24:01,657 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:01,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:01,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:01,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:01,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:01,927 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:01,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 16 treesize of output 18 [2022-07-20 05:24:01,952 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:01,954 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:01,982 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:01,986 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:01,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:02,002 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_500) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:02,010 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_500 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_500) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:02,014 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:02,014 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:02,018 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:02,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:02,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:02,158 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 9 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 35 not checked. [2022-07-20 05:24:02,159 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491450252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:02,159 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:02,159 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 33 [2022-07-20 05:24:02,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696505585] [2022-07-20 05:24:02,159 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:02,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 05:24:02,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:02,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 05:24:02,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=684, Unknown=5, NotChecked=280, Total=1056 [2022-07-20 05:24:02,165 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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-20 05:24:02,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:02,496 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-20 05:24:02,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 05:24:02,497 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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) Word has length 45 [2022-07-20 05:24:02,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:02,497 INFO L225 Difference]: With dead ends: 76 [2022-07-20 05:24:02,497 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 05:24:02,498 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 73 SyntacticMatches, 8 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=135, Invalid=1070, Unknown=5, NotChecked=350, Total=1560 [2022-07-20 05:24:02,498 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 25 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:02,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 268 Invalid, 759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 465 Invalid, 0 Unknown, 286 Unchecked, 0.2s Time] [2022-07-20 05:24:02,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 05:24:02,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2022-07-20 05:24:02,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.06) internal successors, (53), 51 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-20 05:24:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 53 transitions. [2022-07-20 05:24:02,499 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 53 transitions. Word has length 45 [2022-07-20 05:24:02,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:02,499 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 53 transitions. [2022-07-20 05:24:02,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.8181818181818183) internal successors, (93), 33 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-20 05:24:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 53 transitions. [2022-07-20 05:24:02,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-20 05:24:02,500 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:02,500 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:02,519 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:02,700 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,SelfDestructingSolverStorable25 [2022-07-20 05:24:02,700 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:02,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash 801080082, now seen corresponding path program 6 times [2022-07-20 05:24:02,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:02,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942903653] [2022-07-20 05:24:02,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:02,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:02,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 15 proven. 75 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:02,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942903653] [2022-07-20 05:24:02,836 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942903653] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:02,836 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [77081093] [2022-07-20 05:24:02,836 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:02,836 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:02,836 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:02,837 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:02,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 05:24:02,939 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 05:24:02,939 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:02,941 INFO L263 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 33 conjunts are in the unsatisfiable core [2022-07-20 05:24:02,942 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:03,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:03,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-07-20 05:24:03,377 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 28 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:03,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [77081093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:03,377 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:03,377 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 35 [2022-07-20 05:24:03,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117415423] [2022-07-20 05:24:03,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:03,377 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 05:24:03,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:03,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 05:24:03,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=1078, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:24:03,378 INFO L87 Difference]: Start difference. First operand 52 states and 53 transitions. Second operand has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:03,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:03,753 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-20 05:24:03,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:24:03,754 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-07-20 05:24:03,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:03,754 INFO L225 Difference]: With dead ends: 59 [2022-07-20 05:24:03,754 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 05:24:03,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 74 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=443, Invalid=1813, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 05:24:03,755 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 245 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:03,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 182 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 05:24:03,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 55. [2022-07-20 05:24:03,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 53 states have (on average 1.0566037735849056) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-20 05:24:03,757 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 49 [2022-07-20 05:24:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:03,757 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-20 05:24:03,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.342857142857143) internal successors, (117), 36 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:03,757 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-20 05:24:03,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-20 05:24:03,757 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:03,757 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:03,782 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-20 05:24:03,957 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,SelfDestructingSolverStorable26 [2022-07-20 05:24:03,958 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:03,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:03,958 INFO L85 PathProgramCache]: Analyzing trace with hash -936321247, now seen corresponding path program 6 times [2022-07-20 05:24:03,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:03,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770095094] [2022-07-20 05:24:03,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:03,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:03,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:04,095 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:04,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770095094] [2022-07-20 05:24:04,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770095094] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:04,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1511424175] [2022-07-20 05:24:04,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:04,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:04,095 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:04,116 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:04,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 05:24:04,229 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-20 05:24:04,229 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:04,230 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 05:24:04,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:04,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:04,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:24:04,240 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:04,557 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:04,558 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:04,945 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 45 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:04,946 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1511424175] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:04,946 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:04,946 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 39 [2022-07-20 05:24:04,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055074053] [2022-07-20 05:24:04,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:04,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-20 05:24:04,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:04,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-20 05:24:04,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=1335, Unknown=0, NotChecked=0, Total=1560 [2022-07-20 05:24:04,947 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:05,413 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-20 05:24:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 05:24:05,413 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-20 05:24:05,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:05,413 INFO L225 Difference]: With dead ends: 58 [2022-07-20 05:24:05,413 INFO L226 Difference]: Without dead ends: 58 [2022-07-20 05:24:05,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 469 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=532, Invalid=2120, Unknown=0, NotChecked=0, Total=2652 [2022-07-20 05:24:05,414 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 167 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 452 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:05,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 158 Invalid, 452 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:05,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-20 05:24:05,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-07-20 05:24:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0555555555555556) internal successors, (57), 55 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:05,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 57 transitions. [2022-07-20 05:24:05,416 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 57 transitions. Word has length 50 [2022-07-20 05:24:05,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:05,416 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 57 transitions. [2022-07-20 05:24:05,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 3.641025641025641) internal successors, (142), 40 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:05,417 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 57 transitions. [2022-07-20 05:24:05,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-07-20 05:24:05,417 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:05,417 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:05,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:05,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 05:24:05,624 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:05,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:05,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1866312237, now seen corresponding path program 7 times [2022-07-20 05:24:05,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:05,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123607719] [2022-07-20 05:24:05,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:05,625 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:05,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:05,916 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:05,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123607719] [2022-07-20 05:24:05,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123607719] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:05,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1427897985] [2022-07-20 05:24:05,916 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:24:05,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:05,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:05,924 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:05,925 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 05:24:06,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:06,011 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-20 05:24:06,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:06,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:06,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:06,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:06,448 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:06,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:06,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:06,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:06,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:06,507 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:06,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:06,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:06,522 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:06,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:06,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:06,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_677) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:06,553 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_677 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_677) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:24:06,556 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:06,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:06,561 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:06,561 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:06,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:06,726 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 11 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 54 not checked. [2022-07-20 05:24:06,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1427897985] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:06,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:06,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 19, 19] total 37 [2022-07-20 05:24:06,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604295243] [2022-07-20 05:24:06,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:06,727 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 05:24:06,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:06,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 05:24:06,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=852, Unknown=6, NotChecked=378, Total=1332 [2022-07-20 05:24:06,728 INFO L87 Difference]: Start difference. First operand 56 states and 57 transitions. Second operand has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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-20 05:24:07,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:07,205 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2022-07-20 05:24:07,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:24:07,205 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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) Word has length 53 [2022-07-20 05:24:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:07,206 INFO L225 Difference]: With dead ends: 88 [2022-07-20 05:24:07,206 INFO L226 Difference]: Without dead ends: 63 [2022-07-20 05:24:07,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 87 SyntacticMatches, 10 SemanticMatches, 43 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=149, Invalid=1351, Unknown=6, NotChecked=474, Total=1980 [2022-07-20 05:24:07,207 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 23 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 339 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:07,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 348 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 691 Invalid, 0 Unknown, 339 Unchecked, 0.2s Time] [2022-07-20 05:24:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-20 05:24:07,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-20 05:24:07,208 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-20 05:24:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-20 05:24:07,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 53 [2022-07-20 05:24:07,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:07,208 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-20 05:24:07,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.945945945945946) internal successors, (109), 37 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-20 05:24:07,208 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-20 05:24:07,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-20 05:24:07,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:07,209 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:07,226 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-20 05:24:07,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:07,409 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:07,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:07,410 INFO L85 PathProgramCache]: Analyzing trace with hash -795904464, now seen corresponding path program 8 times [2022-07-20 05:24:07,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:07,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175288531] [2022-07-20 05:24:07,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:07,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:07,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:07,597 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 28 proven. 104 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:07,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175288531] [2022-07-20 05:24:07,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175288531] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:07,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1958380937] [2022-07-20 05:24:07,597 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:07,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:07,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:07,608 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 05:24:07,742 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:07,742 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:07,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 05:24:07,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:07,938 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:07,939 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:08,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:24:08,184 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 45 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:08,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1958380937] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:08,184 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:08,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 35 [2022-07-20 05:24:08,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1782717300] [2022-07-20 05:24:08,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 05:24:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:08,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 05:24:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=1095, Unknown=0, NotChecked=0, Total=1260 [2022-07-20 05:24:08,186 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:08,576 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2022-07-20 05:24:08,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:24:08,576 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-20 05:24:08,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:08,577 INFO L225 Difference]: With dead ends: 67 [2022-07-20 05:24:08,577 INFO L226 Difference]: Without dead ends: 67 [2022-07-20 05:24:08,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=381, Invalid=1599, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 05:24:08,577 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 308 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 308 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:08,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [308 Valid, 248 Invalid, 724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:24:08,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-20 05:24:08,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 63. [2022-07-20 05:24:08,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 61 states have (on average 1.0491803278688525) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-20 05:24:08,579 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 57 [2022-07-20 05:24:08,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:08,579 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-20 05:24:08,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.3142857142857145) internal successors, (116), 36 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:08,579 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-20 05:24:08,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-20 05:24:08,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:08,579 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:08,597 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-20 05:24:08,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:08,780 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:08,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:08,781 INFO L85 PathProgramCache]: Analyzing trace with hash 1096765379, now seen corresponding path program 7 times [2022-07-20 05:24:08,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:08,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119762118] [2022-07-20 05:24:08,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:08,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:08,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:09,043 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 28 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:09,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119762118] [2022-07-20 05:24:09,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119762118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:09,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [959030383] [2022-07-20 05:24:09,043 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:24:09,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:09,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:09,044 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:09,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 05:24:09,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:09,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-20 05:24:09,145 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:09,155 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:09,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:24:09,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:09,535 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 45 proven. 93 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:09,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:09,935 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 66 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:09,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [959030383] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:09,935 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:09,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 44 [2022-07-20 05:24:09,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185128467] [2022-07-20 05:24:09,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:09,936 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 05:24:09,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:09,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 05:24:09,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=250, Invalid=1730, Unknown=0, NotChecked=0, Total=1980 [2022-07-20 05:24:09,937 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:10,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:10,352 INFO L93 Difference]: Finished difference Result 66 states and 67 transitions. [2022-07-20 05:24:10,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 05:24:10,353 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 0 states have call successors, (0), 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 58 [2022-07-20 05:24:10,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:10,353 INFO L225 Difference]: With dead ends: 66 [2022-07-20 05:24:10,353 INFO L226 Difference]: Without dead ends: 66 [2022-07-20 05:24:10,354 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=627, Invalid=2795, Unknown=0, NotChecked=0, Total=3422 [2022-07-20 05:24:10,354 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 285 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:10,354 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 228 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:10,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-20 05:24:10,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-07-20 05:24:10,355 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-20 05:24:10,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-20 05:24:10,356 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 58 [2022-07-20 05:24:10,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:10,356 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-20 05:24:10,356 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.75) internal successors, (165), 45 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:10,356 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-20 05:24:10,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-20 05:24:10,357 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:10,357 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:10,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:10,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:10,568 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:10,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:10,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1921179211, now seen corresponding path program 9 times [2022-07-20 05:24:10,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:10,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253283350] [2022-07-20 05:24:10,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:10,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:10,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:11,005 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:11,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:11,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253283350] [2022-07-20 05:24:11,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253283350] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:11,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1005818825] [2022-07-20 05:24:11,007 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:11,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:11,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:11,008 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:11,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-07-20 05:24:11,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-20 05:24:11,280 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:11,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:24:11,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:11,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:11,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:11,601 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:11,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:11,656 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:11,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:11,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:11,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:11,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:11,695 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:11,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:11,717 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:11,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:11,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:11,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)))) is different from false [2022-07-20 05:24:11,742 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:11,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)))) is different from false [2022-07-20 05:24:11,755 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_880 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:24:11,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:11,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:11,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:11,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:11,766 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:11,949 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 77 not checked. [2022-07-20 05:24:11,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1005818825] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:11,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:11,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 21] total 41 [2022-07-20 05:24:11,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205689328] [2022-07-20 05:24:11,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:11,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 05:24:11,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:11,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 05:24:11,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1038, Unknown=7, NotChecked=490, Total=1640 [2022-07-20 05:24:11,951 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:12,735 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-20 05:24:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 05:24:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 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-20 05:24:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:12,736 INFO L225 Difference]: With dead ends: 100 [2022-07-20 05:24:12,736 INFO L226 Difference]: Without dead ends: 71 [2022-07-20 05:24:12,737 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 103 SyntacticMatches, 5 SemanticMatches, 56 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=258, Invalid=2313, Unknown=7, NotChecked=728, Total=3306 [2022-07-20 05:24:12,737 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 73 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 833 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 502 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:12,737 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 431 Invalid, 1384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 833 Invalid, 0 Unknown, 502 Unchecked, 0.3s Time] [2022-07-20 05:24:12,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-07-20 05:24:12,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2022-07-20 05:24:12,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 66 states have (on average 1.0454545454545454) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:12,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-20 05:24:12,738 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 61 [2022-07-20 05:24:12,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:12,738 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-20 05:24:12,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 3.024390243902439) internal successors, (124), 41 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:12,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-20 05:24:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-07-20 05:24:12,739 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:12,739 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:12,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:12,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:12,939 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:12,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:12,940 INFO L85 PathProgramCache]: Analyzing trace with hash 940963662, now seen corresponding path program 10 times [2022-07-20 05:24:12,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:12,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999515037] [2022-07-20 05:24:12,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:12,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:12,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:13,178 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 45 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:13,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999515037] [2022-07-20 05:24:13,179 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999515037] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:13,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112477504] [2022-07-20 05:24:13,179 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:13,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:13,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:13,180 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:13,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-07-20 05:24:13,309 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:13,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:13,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 88 conjunts are in the unsatisfiable core [2022-07-20 05:24:13,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:13,323 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:13,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:13,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:13,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:24:13,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:13,783 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:13,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:13,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:13,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:14,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:14,082 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:14,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 19 treesize of output 19 [2022-07-20 05:24:14,198 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 72 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:14,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:14,750 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrcpy_~from#1.offset_138| Int) (v_ArrVal_962 (Array Int Int))) (or (<= (+ 8 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (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_962) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_138|)))) is different from false [2022-07-20 05:24:14,757 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:14,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:14,762 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:14,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:14,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:15,781 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:15,781 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112477504] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:15,781 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:15,781 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 22, 22] total 60 [2022-07-20 05:24:15,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1596167099] [2022-07-20 05:24:15,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:15,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-07-20 05:24:15,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:15,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-07-20 05:24:15,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=3132, Unknown=1, NotChecked=116, Total=3660 [2022-07-20 05:24:15,783 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:16,563 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= 7 .cse0) (<= 6 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (forall ((v_ArrVal_962 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_962) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1))) (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6))) is different from false [2022-07-20 05:24:16,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:16,754 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-20 05:24:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-20 05:24:16,755 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2022-07-20 05:24:16,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:16,755 INFO L225 Difference]: With dead ends: 80 [2022-07-20 05:24:16,756 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 05:24:16,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 92 SyntacticMatches, 4 SemanticMatches, 78 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=903, Invalid=5101, Unknown=10, NotChecked=306, Total=6320 [2022-07-20 05:24:16,757 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 132 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 789 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 291 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:16,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 371 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 789 Invalid, 0 Unknown, 291 Unchecked, 0.3s Time] [2022-07-20 05:24:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 05:24:16,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 75. [2022-07-20 05:24:16,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0547945205479452) internal successors, (77), 74 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:16,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 77 transitions. [2022-07-20 05:24:16,761 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 77 transitions. Word has length 65 [2022-07-20 05:24:16,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:16,761 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 77 transitions. [2022-07-20 05:24:16,761 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 60 states have (on average 3.1166666666666667) internal successors, (187), 61 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:16,761 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 77 transitions. [2022-07-20 05:24:16,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-20 05:24:16,783 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:16,783 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:16,801 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2022-07-20 05:24:16,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:16,984 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:16,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:16,984 INFO L85 PathProgramCache]: Analyzing trace with hash -894897563, now seen corresponding path program 8 times [2022-07-20 05:24:16,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:16,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514294716] [2022-07-20 05:24:16,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:16,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:17,224 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:17,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514294716] [2022-07-20 05:24:17,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514294716] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:17,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076126933] [2022-07-20 05:24:17,226 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:17,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:17,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:17,227 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:17,228 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-07-20 05:24:17,338 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:17,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:17,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-20 05:24:17,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:17,353 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:24:17,354 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:24:17,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:17,744 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:17,744 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:18,298 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 98 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:18,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076126933] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:18,298 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:18,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18, 18] total 50 [2022-07-20 05:24:18,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124696856] [2022-07-20 05:24:18,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:18,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 05:24:18,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:18,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 05:24:18,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=312, Invalid=2238, Unknown=0, NotChecked=0, Total=2550 [2022-07-20 05:24:18,300 INFO L87 Difference]: Start difference. First operand 75 states and 77 transitions. Second operand has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:19,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:19,045 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-20 05:24:19,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 05:24:19,045 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-20 05:24:19,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:19,045 INFO L225 Difference]: With dead ends: 75 [2022-07-20 05:24:19,046 INFO L226 Difference]: Without dead ends: 75 [2022-07-20 05:24:19,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=795, Invalid=3627, Unknown=0, NotChecked=0, Total=4422 [2022-07-20 05:24:19,047 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 283 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 927 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 1012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:19,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 341 Invalid, 1012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 927 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:24:19,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-20 05:24:19,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-20 05:24:19,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 73 states have (on average 1.0410958904109588) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:19,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-20 05:24:19,048 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-20 05:24:19,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:19,048 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-20 05:24:19,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.78) internal successors, (189), 51 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-20 05:24:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-07-20 05:24:19,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:19,049 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:19,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:19,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:19,249 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:19,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:19,249 INFO L85 PathProgramCache]: Analyzing trace with hash -1905496918, now seen corresponding path program 9 times [2022-07-20 05:24:19,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:19,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861940134] [2022-07-20 05:24:19,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:19,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:19,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:19,445 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 99 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:19,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:19,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861940134] [2022-07-20 05:24:19,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861940134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:19,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [643503557] [2022-07-20 05:24:19,445 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:19,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:19,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:19,446 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:19,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-07-20 05:24:19,784 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-20 05:24:19,784 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:19,787 INFO L263 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 05:24:19,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:19,807 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:19,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:20,290 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:20,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 128 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:20,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [643503557] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:20,664 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:20,665 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 48 [2022-07-20 05:24:20,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597280162] [2022-07-20 05:24:20,665 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:20,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 05:24:20,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:20,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 05:24:20,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1853, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 05:24:20,666 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:21,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:21,290 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-07-20 05:24:21,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 05:24:21,291 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2022-07-20 05:24:21,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:21,291 INFO L225 Difference]: With dead ends: 117 [2022-07-20 05:24:21,291 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 05:24:21,292 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 972 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=817, Invalid=3343, Unknown=0, NotChecked=0, Total=4160 [2022-07-20 05:24:21,292 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 91 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:21,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 198 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 05:24:21,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-20 05:24:21,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 77 states have (on average 1.0389610389610389) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:21,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-20 05:24:21,294 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 70 [2022-07-20 05:24:21,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:21,294 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-20 05:24:21,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 3.5625) internal successors, (171), 48 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-20 05:24:21,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-20 05:24:21,294 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:21,295 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:21,312 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-20 05:24:21,495 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,SelfDestructingSolverStorable34 [2022-07-20 05:24:21,495 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1730266887, now seen corresponding path program 10 times [2022-07-20 05:24:21,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:21,496 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854120838] [2022-07-20 05:24:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:21,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:21,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:21,721 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 66 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:21,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854120838] [2022-07-20 05:24:21,721 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854120838] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:21,721 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568703655] [2022-07-20 05:24:21,721 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:21,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:21,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:21,732 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:21,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-07-20 05:24:21,847 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:21,847 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:21,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 354 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-20 05:24:21,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:21,861 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:21,862 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:21,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:22,508 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:24:22,508 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:23,077 INFO L134 CoverageAnalysis]: Checked inductivity of 248 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-20 05:24:23,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568703655] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:23,078 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:23,078 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 14, 14] total 45 [2022-07-20 05:24:23,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619360580] [2022-07-20 05:24:23,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:23,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 05:24:23,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:23,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 05:24:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=1800, Unknown=0, NotChecked=0, Total=2070 [2022-07-20 05:24:23,081 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:24,716 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-20 05:24:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 05:24:24,716 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-20 05:24:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:24,717 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:24:24,717 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:24:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1193 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1235, Invalid=5245, Unknown=0, NotChecked=0, Total=6480 [2022-07-20 05:24:24,718 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 295 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 988 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 1069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 988 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:24,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 355 Invalid, 1069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 988 Invalid, 0 Unknown, 2 Unchecked, 0.3s Time] [2022-07-20 05:24:24,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:24:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 112. [2022-07-20 05:24:24,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 110 states have (on average 1.1) internal successors, (121), 111 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:24,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 121 transitions. [2022-07-20 05:24:24,720 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 121 transitions. Word has length 74 [2022-07-20 05:24:24,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:24,721 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 121 transitions. [2022-07-20 05:24:24,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 3.511111111111111) internal successors, (158), 46 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:24,721 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 121 transitions. [2022-07-20 05:24:24,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-20 05:24:24,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:24,721 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:24,738 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-20 05:24:24,938 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,SelfDestructingSolverStorable35 [2022-07-20 05:24:24,938 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:24,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:24,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1816661881, now seen corresponding path program 11 times [2022-07-20 05:24:24,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:24,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286710625] [2022-07-20 05:24:24,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:24,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:25,383 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286710625] [2022-07-20 05:24:25,384 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286710625] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909551951] [2022-07-20 05:24:25,384 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:25,384 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:25,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:25,385 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:25,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-07-20 05:24:25,700 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-20 05:24:25,700 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:25,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 400 conjuncts, 102 conjunts are in the unsatisfiable core [2022-07-20 05:24:25,705 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:25,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:26,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:26,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 17 treesize of output 19 [2022-07-20 05:24:26,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:26,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:26,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:26,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-20 05:24:26,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:26,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:26,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-20 05:24:26,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:26,247 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:26,247 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:26,253 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:26,256 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:26,261 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:26,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:26,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:26,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:24:26,301 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-20 05:24:26,309 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1288) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:24:26,317 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1288 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1288) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:24:26,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:26,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:26,325 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:26,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:26,327 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:26,590 INFO L134 CoverageAnalysis]: Checked inductivity of 273 backedges. 17 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 135 not checked. [2022-07-20 05:24:26,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909551951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:26,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:26,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25, 25] total 49 [2022-07-20 05:24:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406513701] [2022-07-20 05:24:26,591 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:26,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-20 05:24:26,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:26,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-20 05:24:26,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1464, Unknown=9, NotChecked=756, Total=2352 [2022-07-20 05:24:26,592 INFO L87 Difference]: Start difference. First operand 112 states and 121 transitions. Second operand has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:27,372 INFO L93 Difference]: Finished difference Result 156 states and 165 transitions. [2022-07-20 05:24:27,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-07-20 05:24:27,372 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 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-20 05:24:27,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:27,374 INFO L225 Difference]: With dead ends: 156 [2022-07-20 05:24:27,374 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 05:24:27,374 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 130 SyntacticMatches, 15 SemanticMatches, 58 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 390 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=191, Invalid=2386, Unknown=9, NotChecked=954, Total=3540 [2022-07-20 05:24:27,375 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 651 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 598 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:27,375 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 651 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1384 Invalid, 0 Unknown, 598 Unchecked, 0.4s Time] [2022-07-20 05:24:27,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 05:24:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2022-07-20 05:24:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.0964912280701755) internal successors, (125), 115 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:27,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 125 transitions. [2022-07-20 05:24:27,379 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 125 transitions. Word has length 77 [2022-07-20 05:24:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:27,379 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 125 transitions. [2022-07-20 05:24:27,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.204081632653061) internal successors, (157), 49 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 125 transitions. [2022-07-20 05:24:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-07-20 05:24:27,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:27,380 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:27,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:27,598 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,SelfDestructingSolverStorable36 [2022-07-20 05:24:27,598 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:27,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:27,599 INFO L85 PathProgramCache]: Analyzing trace with hash 1542890378, now seen corresponding path program 12 times [2022-07-20 05:24:27,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:27,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808025227] [2022-07-20 05:24:27,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:27,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:27,960 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 91 proven. 215 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:27,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:27,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808025227] [2022-07-20 05:24:27,961 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808025227] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:27,961 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052541665] [2022-07-20 05:24:27,961 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:27,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:27,961 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:27,962 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:27,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-07-20 05:24:28,860 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-20 05:24:28,860 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:28,865 INFO L263 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-20 05:24:28,867 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:28,878 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:28,879 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 120 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:29,520 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:30,331 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 153 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:30,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2052541665] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:30,331 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:30,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 22, 22] total 63 [2022-07-20 05:24:30,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10953348] [2022-07-20 05:24:30,331 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:30,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-20 05:24:30,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:30,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-20 05:24:30,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=543, Invalid=3489, Unknown=0, NotChecked=0, Total=4032 [2022-07-20 05:24:30,332 INFO L87 Difference]: Start difference. First operand 116 states and 125 transitions. Second operand has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:31,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:31,244 INFO L93 Difference]: Finished difference Result 116 states and 124 transitions. [2022-07-20 05:24:31,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 05:24:31,245 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 81 [2022-07-20 05:24:31,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:31,245 INFO L225 Difference]: With dead ends: 116 [2022-07-20 05:24:31,245 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 05:24:31,246 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1421 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1338, Invalid=5634, Unknown=0, NotChecked=0, Total=6972 [2022-07-20 05:24:31,246 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 371 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:31,246 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 270 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:24:31,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 05:24:31,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2022-07-20 05:24:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.087719298245614) internal successors, (124), 115 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:31,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 124 transitions. [2022-07-20 05:24:31,248 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 124 transitions. Word has length 81 [2022-07-20 05:24:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:31,248 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 124 transitions. [2022-07-20 05:24:31,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.7301587301587302) internal successors, (235), 64 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 124 transitions. [2022-07-20 05:24:31,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-20 05:24:31,248 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:31,249 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:31,269 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:31,449 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:31,449 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:31,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:31,449 INFO L85 PathProgramCache]: Analyzing trace with hash 1904201381, now seen corresponding path program 13 times [2022-07-20 05:24:31,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:31,449 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529925362] [2022-07-20 05:24:31,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:31,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:31,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:31,917 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:31,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:31,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529925362] [2022-07-20 05:24:31,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529925362] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:31,917 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116579373] [2022-07-20 05:24:31,917 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:24:31,917 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:31,917 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:31,928 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:31,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-07-20 05:24:32,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:32,082 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-20 05:24:32,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:32,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:32,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:32,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 17 treesize of output 19 [2022-07-20 05:24:32,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:32,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:32,673 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:32,674 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:32,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:32,685 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:32,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:32,700 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:32,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:32,714 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:24:32,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-20 05:24:32,728 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:24:32,735 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1478) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:24:32,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1478 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1478) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:24:32,746 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:32,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:32,751 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:32,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:32,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-20 05:24:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 19 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 170 not checked. [2022-07-20 05:24:33,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116579373] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:33,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:33,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27, 27] total 53 [2022-07-20 05:24:33,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706883259] [2022-07-20 05:24:33,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:33,068 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-20 05:24:33,068 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:33,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-20 05:24:33,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1704, Unknown=10, NotChecked=910, Total=2756 [2022-07-20 05:24:33,069 INFO L87 Difference]: Start difference. First operand 116 states and 124 transitions. Second operand has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 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-20 05:24:34,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:34,130 INFO L93 Difference]: Finished difference Result 164 states and 172 transitions. [2022-07-20 05:24:34,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 05:24:34,131 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 85 [2022-07-20 05:24:34,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:34,132 INFO L225 Difference]: With dead ends: 164 [2022-07-20 05:24:34,132 INFO L226 Difference]: Without dead ends: 123 [2022-07-20 05:24:34,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 144 SyntacticMatches, 17 SemanticMatches, 63 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=205, Invalid=2795, Unknown=10, NotChecked=1150, Total=4160 [2022-07-20 05:24:34,138 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 39 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1867 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 795 SdHoareTripleChecker+Invalid, 2748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1867 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 867 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:34,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 795 Invalid, 2748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1867 Invalid, 0 Unknown, 867 Unchecked, 0.6s Time] [2022-07-20 05:24:34,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-20 05:24:34,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 120. [2022-07-20 05:24:34,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.0847457627118644) internal successors, (128), 119 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:34,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 128 transitions. [2022-07-20 05:24:34,140 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 128 transitions. Word has length 85 [2022-07-20 05:24:34,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:34,140 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 128 transitions. [2022-07-20 05:24:34,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 3.2641509433962264) internal successors, (173), 53 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-20 05:24:34,141 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 128 transitions. [2022-07-20 05:24:34,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-20 05:24:34,141 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:34,141 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:34,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:34,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-20 05:24:34,359 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:34,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:34,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1305948504, now seen corresponding path program 14 times [2022-07-20 05:24:34,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:34,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119246924] [2022-07-20 05:24:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:34,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:34,652 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 120 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:34,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:34,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119246924] [2022-07-20 05:24:34,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119246924] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:34,653 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1344382946] [2022-07-20 05:24:34,653 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:24:34,653 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:34,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:34,654 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:34,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-07-20 05:24:34,795 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:24:34,795 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:34,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 05:24:34,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:34,809 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:34,810 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:35,357 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 153 proven. 227 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:35,358 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:36,063 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 190 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:36,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1344382946] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:36,064 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:36,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 24, 24] total 68 [2022-07-20 05:24:36,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931145662] [2022-07-20 05:24:36,064 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:36,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-20 05:24:36,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:36,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-20 05:24:36,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=540, Invalid=4152, Unknown=0, NotChecked=0, Total=4692 [2022-07-20 05:24:36,065 INFO L87 Difference]: Start difference. First operand 120 states and 128 transitions. Second operand has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:36,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:36,927 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-07-20 05:24:36,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-20 05:24:36,927 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 89 [2022-07-20 05:24:36,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:36,928 INFO L225 Difference]: With dead ends: 120 [2022-07-20 05:24:36,928 INFO L226 Difference]: Without dead ends: 120 [2022-07-20 05:24:36,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 131 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1817 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1419, Invalid=6771, Unknown=0, NotChecked=0, Total=8190 [2022-07-20 05:24:36,930 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 412 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1540 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 1663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 1540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:36,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 558 Invalid, 1663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 1540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:24:36,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-20 05:24:36,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-07-20 05:24:36,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 118 states have (on average 1.076271186440678) internal successors, (127), 119 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:36,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 127 transitions. [2022-07-20 05:24:36,934 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 127 transitions. Word has length 89 [2022-07-20 05:24:36,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:36,935 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 127 transitions. [2022-07-20 05:24:36,935 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 68 states have (on average 3.7794117647058822) internal successors, (257), 69 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:36,935 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-07-20 05:24:36,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-20 05:24:36,935 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:36,936 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:36,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:37,154 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,SelfDestructingSolverStorable39 [2022-07-20 05:24:37,154 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:37,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:37,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1102366013, now seen corresponding path program 15 times [2022-07-20 05:24:37,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:37,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665067156] [2022-07-20 05:24:37,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:37,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:37,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:37,679 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:37,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:37,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665067156] [2022-07-20 05:24:37,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665067156] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:37,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1113162515] [2022-07-20 05:24:37,679 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:24:37,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:37,679 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:37,680 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:37,681 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-07-20 05:24:39,378 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-20 05:24:39,378 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:39,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 120 conjunts are in the unsatisfiable core [2022-07-20 05:24:39,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:39,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:39,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:39,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:39,929 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:39,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-20 05:24:39,951 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:39,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:39,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:39,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:39,996 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:40,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:40,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:40,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:40,027 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:40,027 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:40,059 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:40,064 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:40,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:40,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:40,085 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:24:40,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:24:40,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-20 05:24:40,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:24:40,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:24:40,119 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1685) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-20 05:24:40,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1685 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1685) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-20 05:24:40,130 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:40,130 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:40,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:40,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:40,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:40,485 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 21 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 209 not checked. [2022-07-20 05:24:40,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1113162515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:40,485 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:40,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 29] total 57 [2022-07-20 05:24:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029306224] [2022-07-20 05:24:40,485 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-20 05:24:40,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:40,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-20 05:24:40,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1962, Unknown=11, NotChecked=1078, Total=3192 [2022-07-20 05:24:40,486 INFO L87 Difference]: Start difference. First operand 120 states and 127 transitions. Second operand has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:41,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:41,940 INFO L93 Difference]: Finished difference Result 172 states and 179 transitions. [2022-07-20 05:24:41,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-07-20 05:24:41,941 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 93 [2022-07-20 05:24:41,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:41,941 INFO L225 Difference]: With dead ends: 172 [2022-07-20 05:24:41,941 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 05:24:41,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 158 SyntacticMatches, 10 SemanticMatches, 79 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 641 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=336, Invalid=4527, Unknown=11, NotChecked=1606, Total=6480 [2022-07-20 05:24:41,942 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 103 mSDsluCounter, 815 mSDsCounter, 0 mSdLazyCounter, 1920 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 842 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 1920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1059 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:41,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 842 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 1920 Invalid, 0 Unknown, 1059 Unchecked, 0.6s Time] [2022-07-20 05:24:41,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 05:24:41,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 124. [2022-07-20 05:24:41,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0737704918032787) internal successors, (131), 123 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:41,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 131 transitions. [2022-07-20 05:24:41,943 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 131 transitions. Word has length 93 [2022-07-20 05:24:41,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:41,944 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 131 transitions. [2022-07-20 05:24:41,944 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 3.2982456140350878) internal successors, (188), 57 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:41,944 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 131 transitions. [2022-07-20 05:24:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-20 05:24:41,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:41,944 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:41,979 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:42,155 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,SelfDestructingSolverStorable40 [2022-07-20 05:24:42,155 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:42,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:42,156 INFO L85 PathProgramCache]: Analyzing trace with hash 46237638, now seen corresponding path program 16 times [2022-07-20 05:24:42,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:42,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536645085] [2022-07-20 05:24:42,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:42,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:42,429 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 153 proven. 309 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:42,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:42,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536645085] [2022-07-20 05:24:42,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536645085] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:42,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [60644455] [2022-07-20 05:24:42,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:24:42,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:42,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:42,431 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:42,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-20 05:24:42,603 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:24:42,603 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:42,605 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 118 conjunts are in the unsatisfiable core [2022-07-20 05:24:42,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:42,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:42,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:24:43,035 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:24:43,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 18 treesize of output 20 [2022-07-20 05:24:43,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,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 18 treesize of output 20 [2022-07-20 05:24:43,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:24:43,586 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:43,587 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-20 05:24:43,688 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 200 proven. 262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:43,688 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:43,842 WARN L833 $PredicateComparison]: unable to prove that (or (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (<= 0 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (forall ((v_ArrVal_1802 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_1802) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))) is different from false [2022-07-20 05:24:44,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1802 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_303| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1802) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 10 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (<= (+ 12 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_303|)))) is different from false [2022-07-20 05:24:44,398 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:44,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:44,402 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:44,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:44,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 231 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 21 not checked. [2022-07-20 05:24:45,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [60644455] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:45,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:45,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 30, 30] total 84 [2022-07-20 05:24:45,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028321449] [2022-07-20 05:24:45,621 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:45,621 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 85 states [2022-07-20 05:24:45,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:45,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2022-07-20 05:24:45,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=6046, Unknown=2, NotChecked=326, Total=7140 [2022-07-20 05:24:45,626 INFO L87 Difference]: Start difference. First operand 124 states and 131 transitions. Second operand has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-20 05:24:47,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:47,153 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-20 05:24:47,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-20 05:24:47,153 INFO L78 Accepts]: Start accepts. Automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-20 05:24:47,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:47,154 INFO L225 Difference]: With dead ends: 124 [2022-07-20 05:24:47,154 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 05:24:47,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 137 SyntacticMatches, 12 SemanticMatches, 105 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 2101 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1620, Invalid=9303, Unknown=5, NotChecked=414, Total=11342 [2022-07-20 05:24:47,155 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 284 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 1306 mSolverCounterSat, 229 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 596 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 229 IncrementalHoareTripleChecker+Valid, 1306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 569 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:47,155 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [284 Valid, 596 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [229 Valid, 1306 Invalid, 0 Unknown, 569 Unchecked, 0.4s Time] [2022-07-20 05:24:47,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 05:24:47,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-20 05:24:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 122 states have (on average 1.0573770491803278) internal successors, (129), 123 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-20 05:24:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-20 05:24:47,165 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 97 [2022-07-20 05:24:47,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:47,165 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-20 05:24:47,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 85 states, 84 states have (on average 3.369047619047619) internal successors, (283), 85 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-20 05:24:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-20 05:24:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-20 05:24:47,175 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:47,176 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:47,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:47,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:47,392 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:47,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:47,392 INFO L85 PathProgramCache]: Analyzing trace with hash -374809476, now seen corresponding path program 17 times [2022-07-20 05:24:47,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:47,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917486854] [2022-07-20 05:24:47,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:47,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:47,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:47,771 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 280 proven. 276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:47,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917486854] [2022-07-20 05:24:47,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917486854] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:47,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467760996] [2022-07-20 05:24:47,772 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:24:47,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:47,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:47,773 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:47,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-20 05:24:49,447 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-20 05:24:49,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:49,456 INFO L263 TraceCheckSpWp]: Trace formula consists of 534 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 05:24:49,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:49,470 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:24:49,470 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:24:50,290 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:50,290 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:50,752 INFO L134 CoverageAnalysis]: Checked inductivity of 556 backedges. 325 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:50,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467760996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:50,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:50,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28, 28] total 68 [2022-07-20 05:24:50,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143652186] [2022-07-20 05:24:50,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:50,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-07-20 05:24:50,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:50,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-07-20 05:24:50,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=3769, Unknown=0, NotChecked=0, Total=4556 [2022-07-20 05:24:50,753 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:51,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:51,492 INFO L93 Difference]: Finished difference Result 182 states and 187 transitions. [2022-07-20 05:24:51,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-20 05:24:51,493 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2022-07-20 05:24:51,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:51,493 INFO L225 Difference]: With dead ends: 182 [2022-07-20 05:24:51,493 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 05:24:51,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2132 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1615, Invalid=6941, Unknown=0, NotChecked=0, Total=8556 [2022-07-20 05:24:51,494 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 108 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:51,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 226 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:24:51,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 05:24:51,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2022-07-20 05:24:51,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 126 states have (on average 1.0555555555555556) internal successors, (133), 127 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-20 05:24:51,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-20 05:24:51,497 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 105 [2022-07-20 05:24:51,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:51,497 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-20 05:24:51,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 3.735294117647059) internal successors, (254), 68 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:51,497 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-20 05:24:51,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 05:24:51,498 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:51,498 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:51,517 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-20 05:24:51,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:51,717 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:51,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:51,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1637661951, now seen corresponding path program 18 times [2022-07-20 05:24:51,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:51,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486656551] [2022-07-20 05:24:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:52,371 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:52,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486656551] [2022-07-20 05:24:52,371 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486656551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:52,371 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [820695789] [2022-07-20 05:24:52,372 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:24:52,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:52,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:52,373 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:52,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-20 05:24:54,460 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-20 05:24:54,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:24:54,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 548 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-20 05:24:54,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:54,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:24:54,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:24:55,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:24:55,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,157 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,179 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,190 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,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-20 05:24:55,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:24:55,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:24:55,259 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:55,259 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:55,299 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:24:55,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:24:55,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:24:55,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:24:55,340 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)))) is different from false [2022-07-20 05:24:55,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:24:55,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-20 05:24:55,363 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:24:55,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:24:55,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-20 05:24:55,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-20 05:24:55,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2043) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-20 05:24:55,400 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2043 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2043) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:24:55,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:55,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:24:55,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:24:55,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:24:55,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:24:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 601 backedges. 25 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 299 not checked. [2022-07-20 05:24:55,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [820695789] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:55,803 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:55,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32, 33] total 65 [2022-07-20 05:24:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501046164] [2022-07-20 05:24:55,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:55,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-20 05:24:55,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:55,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-20 05:24:55,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2532, Unknown=13, NotChecked=1456, Total=4160 [2022-07-20 05:24:55,804 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:57,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:57,399 INFO L93 Difference]: Finished difference Result 188 states and 193 transitions. [2022-07-20 05:24:57,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 05:24:57,400 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2022-07-20 05:24:57,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:57,400 INFO L225 Difference]: With dead ends: 188 [2022-07-20 05:24:57,400 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 05:24:57,401 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 188 SyntacticMatches, 21 SemanticMatches, 79 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=261, Invalid=4334, Unknown=13, NotChecked=1872, Total=6480 [2022-07-20 05:24:57,401 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 59 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 2655 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 3827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 2655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:57,401 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 1112 Invalid, 3827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 2655 Invalid, 0 Unknown, 1154 Unchecked, 0.9s Time] [2022-07-20 05:24:57,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 05:24:57,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-20 05:24:57,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0538461538461539) internal successors, (137), 131 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:57,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 137 transitions. [2022-07-20 05:24:57,403 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 137 transitions. Word has length 109 [2022-07-20 05:24:57,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:57,403 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 137 transitions. [2022-07-20 05:24:57,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 3.3846153846153846) internal successors, (220), 65 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:57,403 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 137 transitions. [2022-07-20 05:24:57,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-20 05:24:57,404 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:57,404 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:57,427 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-07-20 05:24:57,615 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:57,615 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:57,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:57,615 INFO L85 PathProgramCache]: Analyzing trace with hash 64398338, now seen corresponding path program 19 times [2022-07-20 05:24:57,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:57,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553391403] [2022-07-20 05:24:57,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:57,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:57,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 231 proven. 419 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:58,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:24:58,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553391403] [2022-07-20 05:24:58,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553391403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:24:58,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231486611] [2022-07-20 05:24:58,056 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:24:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:24:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:24:58,057 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:24:58,058 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-20 05:24:58,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:24:58,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 77 conjunts are in the unsatisfiable core [2022-07-20 05:24:58,239 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:24:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:58,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:24:58,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:24:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 276 proven. 374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:24:58,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231486611] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:24:58,934 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:24:58,934 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 63 [2022-07-20 05:24:58,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46751361] [2022-07-20 05:24:58,935 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:24:58,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-07-20 05:24:58,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:24:58,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-07-20 05:24:58,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=494, Invalid=3538, Unknown=0, NotChecked=0, Total=4032 [2022-07-20 05:24:58,936 INFO L87 Difference]: Start difference. First operand 132 states and 137 transitions. Second operand has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:24:59,559 INFO L93 Difference]: Finished difference Result 132 states and 136 transitions. [2022-07-20 05:24:59,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 05:24:59,559 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 113 [2022-07-20 05:24:59,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:24:59,560 INFO L225 Difference]: With dead ends: 132 [2022-07-20 05:24:59,560 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 05:24:59,560 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 190 SyntacticMatches, 2 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1158, Invalid=5162, Unknown=0, NotChecked=0, Total=6320 [2022-07-20 05:24:59,562 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 309 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1857 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 1941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 1857 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:24:59,562 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 660 Invalid, 1941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 1857 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 05:24:59,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 05:24:59,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-20 05:24:59,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 130 states have (on average 1.0461538461538462) internal successors, (136), 131 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-07-20 05:24:59,564 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 113 [2022-07-20 05:24:59,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:24:59,564 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-07-20 05:24:59,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 63 states have (on average 3.619047619047619) internal successors, (228), 64 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:24:59,565 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-07-20 05:24:59,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 05:24:59,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:24:59,567 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:24:59,585 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-20 05:24:59,783 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,SelfDestructingSolverStorable44 [2022-07-20 05:24:59,784 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:24:59,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:24:59,784 INFO L85 PathProgramCache]: Analyzing trace with hash 804967197, now seen corresponding path program 20 times [2022-07-20 05:24:59,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:24:59,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743567860] [2022-07-20 05:24:59,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:24:59,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:24:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 27 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:00,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:00,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1743567860] [2022-07-20 05:25:00,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1743567860] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:00,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261789189] [2022-07-20 05:25:00,529 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:25:00,529 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:00,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:00,531 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:00,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-20 05:25:00,725 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:25:00,725 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:00,728 INFO L263 TraceCheckSpWp]: Trace formula consists of 585 conjuncts, 140 conjunts are in the unsatisfiable core [2022-07-20 05:25:00,737 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:00,743 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:25:00,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:25:01,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-20 05:25:01,551 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:01,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:01,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:01,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:01,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:01,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,256 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:02,748 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:02,748 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 05:25:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:02,931 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:04,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2302 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_411| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) (<= (+ 15 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2302) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |v_ULTIMATE.start_cstrcpy_~from#1.offset_411|)) 0))) is different from false [2022-07-20 05:25:04,067 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:04,067 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:25:04,071 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:04,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:25:04,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 11 treesize of output 7 [2022-07-20 05:25:05,811 INFO L134 CoverageAnalysis]: Checked inductivity of 703 backedges. 325 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:05,811 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1261789189] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:05,811 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:05,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 35, 35] total 102 [2022-07-20 05:25:05,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286973338] [2022-07-20 05:25:05,812 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:05,812 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 102 states [2022-07-20 05:25:05,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:05,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2022-07-20 05:25:05,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=686, Invalid=9416, Unknown=2, NotChecked=198, Total=10302 [2022-07-20 05:25:05,827 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-20 05:25:08,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:08,172 INFO L93 Difference]: Finished difference Result 196 states and 199 transitions. [2022-07-20 05:25:08,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-20 05:25:08,172 INFO L78 Accepts]: Start accepts. Automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-20 05:25:08,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:08,173 INFO L225 Difference]: With dead ends: 196 [2022-07-20 05:25:08,173 INFO L226 Difference]: Without dead ends: 139 [2022-07-20 05:25:08,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 134 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 2388 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=1332, Invalid=16760, Unknown=2, NotChecked=266, Total=18360 [2022-07-20 05:25:08,174 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 169 mSDsluCounter, 1579 mSDsCounter, 0 mSdLazyCounter, 1747 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1613 SdHoareTripleChecker+Invalid, 2803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1038 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:08,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1613 Invalid, 2803 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1747 Invalid, 0 Unknown, 1038 Unchecked, 0.5s Time] [2022-07-20 05:25:08,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-20 05:25:08,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2022-07-20 05:25:08,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 134 states have (on average 1.037313432835821) internal successors, (139), 135 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-20 05:25:08,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 139 transitions. [2022-07-20 05:25:08,178 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 139 transitions. Word has length 117 [2022-07-20 05:25:08,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:08,178 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 139 transitions. [2022-07-20 05:25:08,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 102 states, 102 states have (on average 3.3627450980392157) internal successors, (343), 102 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-20 05:25:08,178 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 139 transitions. [2022-07-20 05:25:08,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-07-20 05:25:08,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:08,179 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:08,196 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-20 05:25:08,395 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:08,396 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:08,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:08,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1561098043, now seen corresponding path program 21 times [2022-07-20 05:25:08,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:08,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104597395] [2022-07-20 05:25:08,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:08,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:09,025 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:09,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:09,025 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104597395] [2022-07-20 05:25:09,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104597395] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:09,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528663817] [2022-07-20 05:25:09,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:25:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:09,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:09,027 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:09,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-20 05:25:11,623 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-20 05:25:11,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:11,635 INFO L263 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-20 05:25:11,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:11,642 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:25:12,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:25:12,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 17 treesize of output 19 [2022-07-20 05:25:12,457 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,475 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,532 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,556 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:12,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:25:12,586 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:12,586 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:12,591 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:12,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:25:12,626 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:12,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:12,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:25:12,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:12,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-20 05:25:12,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:25:12,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:25:12,668 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-20 05:25:12,674 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-20 05:25:12,681 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-20 05:25:12,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-20 05:25:12,693 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2450) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-20 05:25:12,699 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2450 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2450) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:25:12,702 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:12,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:25:12,706 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:12,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:25:12,708 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:13,157 INFO L134 CoverageAnalysis]: Checked inductivity of 813 backedges. 29 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 405 not checked. [2022-07-20 05:25:13,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528663817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:13,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:13,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 37, 37] total 73 [2022-07-20 05:25:13,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818401349] [2022-07-20 05:25:13,157 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:13,158 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-20 05:25:13,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:13,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-20 05:25:13,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3174, Unknown=15, NotChecked=1890, Total=5256 [2022-07-20 05:25:13,158 INFO L87 Difference]: Start difference. First operand 136 states and 139 transitions. Second operand has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:14,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:14,891 INFO L93 Difference]: Finished difference Result 204 states and 207 transitions. [2022-07-20 05:25:14,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-20 05:25:14,892 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 125 [2022-07-20 05:25:14,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:14,892 INFO L225 Difference]: With dead ends: 204 [2022-07-20 05:25:14,892 INFO L226 Difference]: Without dead ends: 143 [2022-07-20 05:25:14,892 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 329 GetRequests, 219 SyntacticMatches, 22 SemanticMatches, 88 ConstructedPredicates, 15 IntricatePredicates, 0 DeprecatedPredicates, 807 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=275, Invalid=5320, Unknown=15, NotChecked=2400, Total=8010 [2022-07-20 05:25:14,893 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 54 mSDsluCounter, 1366 mSDsCounter, 0 mSdLazyCounter, 3490 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 5371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 3490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1861 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:14,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 1401 Invalid, 5371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 3490 Invalid, 0 Unknown, 1861 Unchecked, 1.0s Time] [2022-07-20 05:25:14,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-07-20 05:25:14,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2022-07-20 05:25:14,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.036231884057971) internal successors, (143), 139 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:14,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 143 transitions. [2022-07-20 05:25:14,894 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 143 transitions. Word has length 125 [2022-07-20 05:25:14,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:14,894 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 143 transitions. [2022-07-20 05:25:14,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 73 states have (on average 3.4657534246575343) internal successors, (253), 73 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:14,895 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 143 transitions. [2022-07-20 05:25:14,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 05:25:14,895 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:14,895 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:14,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:15,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:15,103 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:15,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:15,104 INFO L85 PathProgramCache]: Analyzing trace with hash -1500121026, now seen corresponding path program 22 times [2022-07-20 05:25:15,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:15,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687381439] [2022-07-20 05:25:15,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:15,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:15,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:15,626 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 325 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:15,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:15,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687381439] [2022-07-20 05:25:15,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687381439] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:15,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [131147579] [2022-07-20 05:25:15,627 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:25:15,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:15,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:15,628 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:15,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-07-20 05:25:15,840 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:25:15,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:15,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 586 conjuncts, 152 conjunts are in the unsatisfiable core [2022-07-20 05:25:15,848 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:15,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:25:15,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:25:16,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:25:16,821 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:16,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:16,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,391 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,545 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,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 18 treesize of output 20 [2022-07-20 05:25:17,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:25:17,902 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:17,902 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-20 05:25:18,063 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 392 proven. 478 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:18,063 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:19,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2605 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_472| Int)) (or (<= (+ 16 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2605) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrcpy_~from#1.offset_472|)) 0))) is different from false [2022-07-20 05:25:19,477 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:19,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:25:19,482 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:19,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:25:19,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:21,441 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:21,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [131147579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:21,441 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:21,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 38, 38] total 107 [2022-07-20 05:25:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781543475] [2022-07-20 05:25:21,441 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:21,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-20 05:25:21,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-20 05:25:21,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1166, Invalid=10178, Unknown=2, NotChecked=210, Total=11556 [2022-07-20 05:25:21,443 INFO L87 Difference]: Start difference. First operand 140 states and 143 transitions. Second operand has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:22,870 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#length| |c_ULTIMATE.start_cstrcpy_~from#1.base|)) (.cse1 (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2))) (and (<= |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14) (<= 15 .cse0) (<= 14 |c_ULTIMATE.start_cstrcpy_~from#1.offset|) (or (not (= |c_ULTIMATE.start_cstrcpy_~from#1.offset| (+ .cse0 (- 1)))) (= |c_ULTIMATE.start_cstrcpy_#t~mem4#1| 0)) (<= .cse1 .cse0) (or (and (<= (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3) .cse0) (<= 0 .cse1)) (forall ((v_ArrVal_2605 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2605) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0))))) is different from false [2022-07-20 05:25:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:23,097 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-20 05:25:23,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:25:23,098 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 129 [2022-07-20 05:25:23,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:23,098 INFO L225 Difference]: With dead ends: 142 [2022-07-20 05:25:23,098 INFO L226 Difference]: Without dead ends: 142 [2022-07-20 05:25:23,100 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 210 SyntacticMatches, 4 SemanticMatches, 132 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3173 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=2496, Invalid=14795, Unknown=9, NotChecked=522, Total=17822 [2022-07-20 05:25:23,100 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 388 mSDsluCounter, 953 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 281 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 2014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 281 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:23,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 989 Invalid, 2014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [281 Valid, 1386 Invalid, 0 Unknown, 347 Unchecked, 0.4s Time] [2022-07-20 05:25:23,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-07-20 05:25:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2022-07-20 05:25:23,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 138 states have (on average 1.0217391304347827) internal successors, (141), 139 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:23,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 141 transitions. [2022-07-20 05:25:23,102 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 141 transitions. Word has length 129 [2022-07-20 05:25:23,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:23,102 INFO L495 AbstractCegarLoop]: Abstraction has 140 states and 141 transitions. [2022-07-20 05:25:23,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 107 states have (on average 3.542056074766355) internal successors, (379), 108 states have internal predecessors, (379), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:23,102 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 141 transitions. [2022-07-20 05:25:23,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-20 05:25:23,103 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:23,103 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:23,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:23,329 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-20 05:25:23,329 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:23,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -366914316, now seen corresponding path program 23 times [2022-07-20 05:25:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:23,330 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780863770] [2022-07-20 05:25:23,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:23,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:23,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:23,864 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 500 proven. 496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:23,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:23,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780863770] [2022-07-20 05:25:23,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780863770] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:23,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724104845] [2022-07-20 05:25:23,865 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:25:23,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:23,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:23,866 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:23,867 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-07-20 05:25:26,707 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-20 05:25:26,708 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:26,720 INFO L263 TraceCheckSpWp]: Trace formula consists of 682 conjuncts, 80 conjunts are in the unsatisfiable core [2022-07-20 05:25:26,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:26,734 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:25:26,734 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:25:27,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:25:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:27,968 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:28,019 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 6 treesize of output 4 [2022-07-20 05:25:28,855 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 561 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:28,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724104845] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:28,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:28,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 36, 36] total 88 [2022-07-20 05:25:28,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129201361] [2022-07-20 05:25:28,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:28,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 88 states [2022-07-20 05:25:28,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:28,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2022-07-20 05:25:28,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=6357, Unknown=0, NotChecked=0, Total=7656 [2022-07-20 05:25:28,857 INFO L87 Difference]: Start difference. First operand 140 states and 141 transitions. Second operand has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:30,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:30,113 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-20 05:25:30,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 05:25:30,114 INFO L78 Accepts]: Start accepts. Automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-07-20 05:25:30,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:30,114 INFO L225 Difference]: With dead ends: 214 [2022-07-20 05:25:30,114 INFO L226 Difference]: Without dead ends: 147 [2022-07-20 05:25:30,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 221 SyntacticMatches, 1 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3740 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2685, Invalid=11835, Unknown=0, NotChecked=0, Total=14520 [2022-07-20 05:25:30,115 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 196 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 778 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:30,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 268 Invalid, 778 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 05:25:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-07-20 05:25:30,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 144. [2022-07-20 05:25:30,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 142 states have (on average 1.0211267605633803) internal successors, (145), 143 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2022-07-20 05:25:30,117 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 137 [2022-07-20 05:25:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:30,117 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2022-07-20 05:25:30,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 88 states, 88 states have (on average 3.7954545454545454) internal successors, (334), 88 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:30,117 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2022-07-20 05:25:30,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-20 05:25:30,118 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:30,118 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:30,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:30,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-07-20 05:25:30,327 INFO L420 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:30,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:30,328 INFO L85 PathProgramCache]: Analyzing trace with hash -366217, now seen corresponding path program 24 times [2022-07-20 05:25:30,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:30,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292434279] [2022-07-20 05:25:30,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:30,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:30,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:31,137 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:31,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:31,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292434279] [2022-07-20 05:25:31,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292434279] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:31,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409206788] [2022-07-20 05:25:31,138 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:25:31,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:31,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:31,139 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:31,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-07-20 05:25:43,816 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-20 05:25:43,816 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:25:43,845 INFO L263 TraceCheckSpWp]: Trace formula consists of 696 conjuncts, 176 conjunts are in the unsatisfiable core [2022-07-20 05:25:43,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:43,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:25:44,336 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:25:44,424 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:25:44,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-20 05:25:44,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,469 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,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 16 treesize of output 18 [2022-07-20 05:25:44,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,499 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,547 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,576 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:25:44,581 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:25:44,583 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:44,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:44,611 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:25:44,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:25:44,629 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:25:44,634 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:25:44,639 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:25:44,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:25:44,648 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)))) is different from false [2022-07-20 05:25:44,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:25:44,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:25:44,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-20 05:25:44,667 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-20 05:25:44,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-20 05:25:44,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-20 05:25:44,689 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-20 05:25:44,694 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-20 05:25:44,705 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_2915) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-20 05:25:44,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2915 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2915) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:25:44,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:44,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:25:44,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:25:44,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:25:44,718 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:25:45,050 INFO L134 CoverageAnalysis]: Checked inductivity of 1057 backedges. 33 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 527 not checked. [2022-07-20 05:25:45,051 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409206788] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:45,051 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:45,051 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 41] total 81 [2022-07-20 05:25:45,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828531459] [2022-07-20 05:25:45,051 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:45,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 81 states [2022-07-20 05:25:45,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:45,052 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2022-07-20 05:25:45,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=3888, Unknown=17, NotChecked=2380, Total=6480 [2022-07-20 05:25:45,053 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:46,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:46,914 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-20 05:25:46,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-07-20 05:25:46,915 INFO L78 Accepts]: Start accepts. Automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 141 [2022-07-20 05:25:46,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:46,916 INFO L225 Difference]: With dead ends: 220 [2022-07-20 05:25:46,916 INFO L226 Difference]: Without dead ends: 151 [2022-07-20 05:25:46,916 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 371 GetRequests, 247 SyntacticMatches, 26 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 0 DeprecatedPredicates, 1019 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=303, Invalid=6554, Unknown=17, NotChecked=3026, Total=9900 [2022-07-20 05:25:46,917 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 55 mSDsluCounter, 1911 mSDsCounter, 0 mSdLazyCounter, 4997 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 7366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2348 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:46,917 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 1950 Invalid, 7366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4997 Invalid, 0 Unknown, 2348 Unchecked, 1.1s Time] [2022-07-20 05:25:46,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2022-07-20 05:25:46,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 148. [2022-07-20 05:25:46,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 146 states have (on average 1.0205479452054795) 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-20 05:25:46,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-20 05:25:46,919 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 141 [2022-07-20 05:25:46,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:46,919 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-20 05:25:46,919 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 81 states, 81 states have (on average 3.506172839506173) internal successors, (284), 81 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:46,919 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-20 05:25:46,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-20 05:25:46,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:46,920 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:46,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:47,128 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-07-20 05:25:47,128 INFO L420 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:47,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:47,129 INFO L85 PathProgramCache]: Analyzing trace with hash -1570798470, now seen corresponding path program 25 times [2022-07-20 05:25:47,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:47,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047007671] [2022-07-20 05:25:47,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:47,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:47,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:47,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 435 proven. 687 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:47,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047007671] [2022-07-20 05:25:47,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047007671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:47,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040839761] [2022-07-20 05:25:47,766 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:25:47,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:47,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:47,767 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:47,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-07-20 05:25:48,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:48,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 97 conjunts are in the unsatisfiable core [2022-07-20 05:25:48,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:25:48,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:48,788 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:25:49,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-20 05:25:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 496 proven. 626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:49,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1040839761] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:25:49,453 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:25:49,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 39, 39] total 78 [2022-07-20 05:25:49,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451884896] [2022-07-20 05:25:49,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:25:49,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 79 states [2022-07-20 05:25:49,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:25:49,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2022-07-20 05:25:49,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=612, Invalid=5550, Unknown=0, NotChecked=0, Total=6162 [2022-07-20 05:25:49,455 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:50,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:25:50,824 INFO L93 Difference]: Finished difference Result 155 states and 156 transitions. [2022-07-20 05:25:50,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 05:25:50,825 INFO L78 Accepts]: Start accepts. Automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 145 [2022-07-20 05:25:50,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:25:50,826 INFO L225 Difference]: With dead ends: 155 [2022-07-20 05:25:50,826 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 05:25:50,827 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 246 SyntacticMatches, 2 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2084 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2382, Invalid=10728, Unknown=0, NotChecked=0, Total=13110 [2022-07-20 05:25:50,828 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 449 mSDsluCounter, 992 mSDsCounter, 0 mSdLazyCounter, 2921 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 3048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 2921 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:25:50,828 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 1032 Invalid, 3048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 2921 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:25:50,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 05:25:50,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-20 05:25:50,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 149 states have (on average 1.0201342281879195) internal successors, (152), 150 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:50,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-20 05:25:50,830 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 145 [2022-07-20 05:25:50,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:25:50,830 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-20 05:25:50,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 79 states, 78 states have (on average 3.7435897435897436) internal successors, (292), 79 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:25:50,830 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-20 05:25:50,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-20 05:25:50,831 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:25:50,831 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:25:50,851 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-07-20 05:25:51,048 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:51,048 INFO L420 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:25:51,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:25:51,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1450112327, now seen corresponding path program 11 times [2022-07-20 05:25:51,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:25:51,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967054285] [2022-07-20 05:25:51,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:25:51,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:25:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:25:51,667 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:25:51,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:25:51,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967054285] [2022-07-20 05:25:51,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967054285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:25:51,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573184623] [2022-07-20 05:25:51,668 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:25:51,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:25:51,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:25:51,670 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:25:51,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-07-20 05:26:03,098 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-20 05:26:03,099 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:03,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 716 conjuncts, 138 conjunts are in the unsatisfiable core [2022-07-20 05:26:03,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:03,132 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:26:03,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:26:04,494 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:04,494 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:06,015 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 561 proven. 578 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:06,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1573184623] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:06,015 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:26:06,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 37, 37] total 109 [2022-07-20 05:26:06,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125776175] [2022-07-20 05:26:06,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:06,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 110 states [2022-07-20 05:26:06,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:26:06,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2022-07-20 05:26:06,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1465, Invalid=10525, Unknown=0, NotChecked=0, Total=11990 [2022-07-20 05:26:06,018 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:07,079 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2022-07-20 05:26:07,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-20 05:26:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-07-20 05:26:07,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:07,080 INFO L225 Difference]: With dead ends: 154 [2022-07-20 05:26:07,080 INFO L226 Difference]: Without dead ends: 154 [2022-07-20 05:26:07,081 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4501 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=2815, Invalid=14215, Unknown=0, NotChecked=0, Total=17030 [2022-07-20 05:26:07,081 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 725 mSDsluCounter, 994 mSDsCounter, 0 mSdLazyCounter, 2974 mSolverCounterSat, 232 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1034 SdHoareTripleChecker+Invalid, 3206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 232 IncrementalHoareTripleChecker+Valid, 2974 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:07,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1034 Invalid, 3206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [232 Valid, 2974 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 05:26:07,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2022-07-20 05:26:07,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2022-07-20 05:26:07,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 150 states have (on average 1.02) 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-20 05:26:07,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-20 05:26:07,083 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 146 [2022-07-20 05:26:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:07,084 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-20 05:26:07,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 110 states, 109 states have (on average 3.944954128440367) internal successors, (430), 110 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:07,084 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-20 05:26:07,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-20 05:26:07,084 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:07,084 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:07,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Ended with exit code 0 [2022-07-20 05:26:07,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51,38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:07,300 INFO L420 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:26:07,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:07,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1515276395, now seen corresponding path program 26 times [2022-07-20 05:26:07,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:26:07,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861060597] [2022-07-20 05:26:07,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:07,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:26:07,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:08,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 35 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:08,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:26:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861060597] [2022-07-20 05:26:08,120 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861060597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:26:08,120 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [119134261] [2022-07-20 05:26:08,120 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:26:08,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:08,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:26:08,122 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:26:08,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-07-20 05:26:08,358 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:26:08,358 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:08,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 170 conjunts are in the unsatisfiable core [2022-07-20 05:26:08,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:08,380 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:26:08,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:26:08,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:26:09,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:26:09,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:09,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:09,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:09,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:09,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:09,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:10,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:11,008 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:11,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:11,322 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:26:11,519 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:11,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 18 [2022-07-20 05:26:11,742 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 496 proven. 695 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:11,742 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:26:13,726 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3395 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_630| Int)) (or (<= (+ 19 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (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_3395) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 17 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|) (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_630|)))) is different from false [2022-07-20 05:26:13,735 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:13,735 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:26:13,739 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:26:13,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:26:13,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:26:16,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1191 backedges. 561 proven. 630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:16,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [119134261] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:26:16,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:26:16,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 43, 43] total 126 [2022-07-20 05:26:16,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [492917645] [2022-07-20 05:26:16,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:26:16,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-20 05:26:16,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:26:16,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-20 05:26:16,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1009, Invalid=14493, Unknown=2, NotChecked=246, Total=15750 [2022-07-20 05:26:16,195 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:18,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:26:18,998 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2022-07-20 05:26:18,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-07-20 05:26:18,998 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 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 149 [2022-07-20 05:26:18,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:26:18,999 INFO L225 Difference]: With dead ends: 239 [2022-07-20 05:26:18,999 INFO L226 Difference]: Without dead ends: 166 [2022-07-20 05:26:19,000 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 449 GetRequests, 280 SyntacticMatches, 3 SemanticMatches, 166 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3608 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=1937, Invalid=25787, Unknown=2, NotChecked=330, Total=28056 [2022-07-20 05:26:19,000 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 184 mSDsluCounter, 2265 mSDsCounter, 0 mSdLazyCounter, 2322 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 2306 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 2322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1538 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:26:19,001 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 2306 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 2322 Invalid, 0 Unknown, 1538 Unchecked, 0.6s Time] [2022-07-20 05:26:19,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-07-20 05:26:19,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 159. [2022-07-20 05:26:19,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 157 states have (on average 1.019108280254777) internal successors, (160), 158 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:19,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2022-07-20 05:26:19,003 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 149 [2022-07-20 05:26:19,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:26:19,003 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2022-07-20 05:26:19,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 3.484126984126984) internal successors, (439), 126 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:26:19,003 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2022-07-20 05:26:19,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-07-20 05:26:19,004 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:26:19,004 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:26:19,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-07-20 05:26:19,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable52 [2022-07-20 05:26:19,206 INFO L420 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:26:19,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:26:19,207 INFO L85 PathProgramCache]: Analyzing trace with hash -349318309, now seen corresponding path program 12 times [2022-07-20 05:26:19,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:26:19,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638506953] [2022-07-20 05:26:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:26:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:26:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:26:19,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 496 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:19,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:26:19,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638506953] [2022-07-20 05:26:19,842 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638506953] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:26:19,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333433737] [2022-07-20 05:26:19,843 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-20 05:26:19,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:26:19,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:26:19,844 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:26:19,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-07-20 05:26:56,355 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-07-20 05:26:56,355 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:26:56,409 INFO L263 TraceCheckSpWp]: Trace formula consists of 753 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-20 05:26:56,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:26:56,427 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:26:56,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:26:56,434 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:26:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 561 proven. 717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:26:58,233 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:00,086 INFO L134 CoverageAnalysis]: Checked inductivity of 1278 backedges. 630 proven. 648 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:00,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333433737] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:00,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:00,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 40, 40] total 117 [2022-07-20 05:27:00,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510480315] [2022-07-20 05:27:00,086 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:00,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 118 states [2022-07-20 05:27:00,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:00,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2022-07-20 05:27:00,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1778, Invalid=12028, Unknown=0, NotChecked=0, Total=13806 [2022-07-20 05:27:00,089 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:01,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:01,991 INFO L93 Difference]: Finished difference Result 162 states and 163 transitions. [2022-07-20 05:27:01,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-20 05:27:01,992 INFO L78 Accepts]: Start accepts. Automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 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 154 [2022-07-20 05:27:01,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:01,992 INFO L225 Difference]: With dead ends: 162 [2022-07-20 05:27:01,992 INFO L226 Difference]: Without dead ends: 162 [2022-07-20 05:27:01,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5387 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=4495, Invalid=19997, Unknown=0, NotChecked=0, Total=24492 [2022-07-20 05:27:01,993 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 1129 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 2051 mSolverCounterSat, 346 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1129 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 2397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 346 IncrementalHoareTripleChecker+Valid, 2051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:01,993 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1129 Valid, 710 Invalid, 2397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [346 Valid, 2051 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:27:01,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-20 05:27:01,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 160. [2022-07-20 05:27:01,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 158 states have (on average 1.018987341772152) internal successors, (161), 159 states have internal predecessors, (161), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:01,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 161 transitions. [2022-07-20 05:27:01,995 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 161 transitions. Word has length 154 [2022-07-20 05:27:01,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:01,995 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 161 transitions. [2022-07-20 05:27:01,996 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 118 states, 117 states have (on average 3.8803418803418803) internal successors, (454), 118 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:01,996 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 161 transitions. [2022-07-20 05:27:01,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 05:27:01,996 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:01,996 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:02,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:02,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-07-20 05:27:02,211 INFO L420 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:27:02,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:02,212 INFO L85 PathProgramCache]: Analyzing trace with hash 164008883, now seen corresponding path program 27 times [2022-07-20 05:27:02,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:02,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989799664] [2022-07-20 05:27:02,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:02,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:02,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:03,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:03,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:03,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989799664] [2022-07-20 05:27:03,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989799664] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:03,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089691298] [2022-07-20 05:27:03,266 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:27:03,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:03,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:03,267 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:03,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-07-20 05:27:15,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 20 check-sat command(s) [2022-07-20 05:27:15,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:15,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 770 conjuncts, 194 conjunts are in the unsatisfiable core [2022-07-20 05:27:15,742 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:15,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:16,384 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-20 05:27:16,478 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-20 05:27:16,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,535 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,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-20 05:27:16,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-20 05:27:16,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,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-20 05:27:16,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,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-20 05:27:16,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 05:27:16,655 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 05:27:16,657 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:16,657 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:16,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 1)) 0)) is different from false [2022-07-20 05:27:16,665 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 2)) 0)) is different from false [2022-07-20 05:27:16,672 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 3)) 0)) is different from false [2022-07-20 05:27:16,677 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 4)) 0)) is different from false [2022-07-20 05:27:16,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 5)) 0)) is different from false [2022-07-20 05:27:16,687 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 6)) 0)) is different from false [2022-07-20 05:27:16,691 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ 7 |c_ULTIMATE.start_cstrcpy_~from#1.offset|)) 0)) is different from false [2022-07-20 05:27:16,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 8)) 0)) is different from false [2022-07-20 05:27:16,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 9)) 0)) is different from false [2022-07-20 05:27:16,706 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 10)) 0)) is different from false [2022-07-20 05:27:16,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 11)) 0)) is different from false [2022-07-20 05:27:16,743 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 12)) 0)) is different from false [2022-07-20 05:27:16,748 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 13)) 0)) is different from false [2022-07-20 05:27:16,754 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 14)) 0)) is different from false [2022-07-20 05:27:16,760 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 15)) 0)) is different from false [2022-07-20 05:27:16,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 16)) 0)) is different from false [2022-07-20 05:27:16,771 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 17)) 0)) is different from false [2022-07-20 05:27:16,776 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrcpy_~to#1.base| v_ArrVal_3740) |c_ULTIMATE.start_cstrcpy_~from#1.base|) (+ |c_ULTIMATE.start_cstrcpy_~from#1.offset| 18)))) is different from false [2022-07-20 05:27:16,782 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3740 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3740) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-20 05:27:16,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:16,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:27:16,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:16,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:27:16,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:27:17,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1333 backedges. 37 proven. 631 refuted. 0 times theorem prover too weak. 0 trivial. 665 not checked. [2022-07-20 05:27:17,489 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089691298] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:17,489 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:17,489 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 45, 45] total 89 [2022-07-20 05:27:17,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031316637] [2022-07-20 05:27:17,489 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:17,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 89 states [2022-07-20 05:27:17,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:17,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2022-07-20 05:27:17,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=4674, Unknown=19, NotChecked=2926, Total=7832 [2022-07-20 05:27:17,490 INFO L87 Difference]: Start difference. First operand 160 states and 161 transitions. Second operand has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:20,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:20,926 INFO L93 Difference]: Finished difference Result 244 states and 245 transitions. [2022-07-20 05:27:20,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-20 05:27:20,926 INFO L78 Accepts]: Start accepts. Automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 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-20 05:27:20,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:20,927 INFO L225 Difference]: With dead ends: 244 [2022-07-20 05:27:20,927 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 05:27:20,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 273 SyntacticMatches, 31 SemanticMatches, 111 ConstructedPredicates, 19 IntricatePredicates, 0 DeprecatedPredicates, 1402 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=367, Invalid=8432, Unknown=19, NotChecked=3838, Total=12656 [2022-07-20 05:27:20,928 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 62 mSDsluCounter, 2344 mSDsCounter, 0 mSdLazyCounter, 6229 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 2387 SdHoareTripleChecker+Invalid, 9217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2962 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:20,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 2387 Invalid, 9217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6229 Invalid, 0 Unknown, 2962 Unchecked, 2.0s Time] [2022-07-20 05:27:20,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 05:27:20,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2022-07-20 05:27:20,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 162 states have (on average 1.0185185185185186) internal successors, (165), 163 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:20,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 165 transitions. [2022-07-20 05:27:20,929 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 165 transitions. Word has length 157 [2022-07-20 05:27:20,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:20,930 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 165 transitions. [2022-07-20 05:27:20,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 89 states, 89 states have (on average 3.561797752808989) internal successors, (317), 89 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:20,930 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 165 transitions. [2022-07-20 05:27:20,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-07-20 05:27:20,930 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:20,930 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:20,955 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:21,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-07-20 05:27:21,139 INFO L420 AbstractCegarLoop]: === Iteration 56 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:27:21,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:21,140 INFO L85 PathProgramCache]: Analyzing trace with hash 512968886, now seen corresponding path program 28 times [2022-07-20 05:27:21,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:21,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447516760] [2022-07-20 05:27:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:21,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:21,775 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 561 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:21,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447516760] [2022-07-20 05:27:21,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447516760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:21,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400311370] [2022-07-20 05:27:21,776 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-20 05:27:21,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:21,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:21,777 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:21,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-07-20 05:27:22,058 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-20 05:27:22,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:22,062 INFO L263 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 184 conjunts are in the unsatisfiable core [2022-07-20 05:27:22,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:22,072 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:27:22,072 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:27:22,076 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:22,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-20 05:27:22,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,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 18 treesize of output 20 [2022-07-20 05:27:23,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,902 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-20 05:27:23,995 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:23,995 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-20 05:27:24,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 648 proven. 758 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:24,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:26,089 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3930 (Array Int Int)) (|v_ULTIMATE.start_cstrcpy_~from#1.offset_726| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) (<= (+ 20 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_3930) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 18 |v_ULTIMATE.start_cstrcpy_~from#1.offset_726|)) 0))) is different from false [2022-07-20 05:27:26,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:26,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 05:27:26,100 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 05:27:26,100 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-20 05:27:26,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 05:27:29,327 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 703 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:29,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400311370] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:29,327 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:29,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 46, 46] total 131 [2022-07-20 05:27:29,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181459927] [2022-07-20 05:27:29,328 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:29,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-20 05:27:29,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-20 05:27:29,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1728, Invalid=15304, Unknown=2, NotChecked=258, Total=17292 [2022-07-20 05:27:29,336 INFO L87 Difference]: Start difference. First operand 164 states and 165 transitions. Second operand has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:32,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:32,160 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-20 05:27:32,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-20 05:27:32,161 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 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 161 [2022-07-20 05:27:32,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:32,161 INFO L225 Difference]: With dead ends: 176 [2022-07-20 05:27:32,161 INFO L226 Difference]: Without dead ends: 176 [2022-07-20 05:27:32,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 248 SyntacticMatches, 3 SemanticMatches, 160 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 4825 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=3667, Invalid=22095, Unknown=2, NotChecked=318, Total=26082 [2022-07-20 05:27:32,162 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 431 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3098 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 5289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 3098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1834 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:32,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 1579 Invalid, 5289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 3098 Invalid, 0 Unknown, 1834 Unchecked, 1.0s Time] [2022-07-20 05:27:32,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-07-20 05:27:32,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 171. [2022-07-20 05:27:32,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.0236686390532543) internal successors, (173), 170 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-20 05:27:32,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 173 transitions. [2022-07-20 05:27:32,164 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 173 transitions. Word has length 161 [2022-07-20 05:27:32,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:32,164 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 173 transitions. [2022-07-20 05:27:32,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 131 states have (on average 3.6259541984732824) internal successors, (475), 132 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:32,165 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 173 transitions. [2022-07-20 05:27:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-07-20 05:27:32,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:32,165 INFO L195 NwaCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:32,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:32,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:32,375 INFO L420 AbstractCegarLoop]: === Iteration 57 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:27:32,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1277833731, now seen corresponding path program 13 times [2022-07-20 05:27:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:32,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565738280] [2022-07-20 05:27:32,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:33,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 561 proven. 864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:33,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:33,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565738280] [2022-07-20 05:27:33,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565738280] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:33,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [305593071] [2022-07-20 05:27:33,028 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-20 05:27:33,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:33,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:33,030 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:33,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-07-20 05:27:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:33,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 790 conjuncts, 117 conjunts are in the unsatisfiable core [2022-07-20 05:27:33,325 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:33,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 05:27:33,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:27:33,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:27:34,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 630 proven. 795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:34,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:36,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1425 backedges. 703 proven. 722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:36,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [305593071] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:36,459 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:36,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 42, 42] total 122 [2022-07-20 05:27:36,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586838316] [2022-07-20 05:27:36,460 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:36,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 123 states [2022-07-20 05:27:36,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:36,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2022-07-20 05:27:36,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=13404, Unknown=0, NotChecked=0, Total=15006 [2022-07-20 05:27:36,462 INFO L87 Difference]: Start difference. First operand 171 states and 173 transitions. Second operand has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:38,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:38,482 INFO L93 Difference]: Finished difference Result 171 states and 172 transitions. [2022-07-20 05:27:38,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-20 05:27:38,482 INFO L78 Accepts]: Start accepts. Automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 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 162 [2022-07-20 05:27:38,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:38,483 INFO L225 Difference]: With dead ends: 171 [2022-07-20 05:27:38,483 INFO L226 Difference]: Without dead ends: 171 [2022-07-20 05:27:38,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6362 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=4371, Invalid=22035, Unknown=0, NotChecked=0, Total=26406 [2022-07-20 05:27:38,485 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 733 mSDsluCounter, 1328 mSDsCounter, 0 mSdLazyCounter, 3965 mSolverCounterSat, 236 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 733 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 4201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 236 IncrementalHoareTripleChecker+Valid, 3965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:38,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [733 Valid, 1372 Invalid, 4201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [236 Valid, 3965 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-20 05:27:38,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-07-20 05:27:38,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2022-07-20 05:27:38,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 169 states have (on average 1.017751479289941) internal successors, (172), 170 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:38,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2022-07-20 05:27:38,487 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 162 [2022-07-20 05:27:38,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:38,487 INFO L495 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2022-07-20 05:27:38,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 123 states, 122 states have (on average 3.9098360655737703) internal successors, (477), 123 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:38,488 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2022-07-20 05:27:38,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 05:27:38,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:38,488 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:38,507 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Ended with exit code 0 [2022-07-20 05:27:38,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:38,696 INFO L420 AbstractCegarLoop]: === Iteration 58 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:27:38,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:38,696 INFO L85 PathProgramCache]: Analyzing trace with hash 403815490, now seen corresponding path program 14 times [2022-07-20 05:27:38,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:38,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203513118] [2022-07-20 05:27:38,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:38,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:39,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 723 proven. 780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:39,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:39,420 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203513118] [2022-07-20 05:27:39,421 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203513118] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:39,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [49911843] [2022-07-20 05:27:39,421 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 05:27:39,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:39,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:39,436 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:39,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-07-20 05:27:39,737 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 05:27:39,737 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:27:39,740 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 91 conjunts are in the unsatisfiable core [2022-07-20 05:27:39,743 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:27:39,752 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 05:27:39,752 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2022-07-20 05:27:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 800 proven. 703 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:41,334 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:27:42,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1503 backedges. 780 proven. 723 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:42,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [49911843] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:27:42,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:27:42,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 45, 45] total 109 [2022-07-20 05:27:42,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735213159] [2022-07-20 05:27:42,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:27:42,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 109 states [2022-07-20 05:27:42,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:27:42,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2022-07-20 05:27:42,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2153, Invalid=9619, Unknown=0, NotChecked=0, Total=11772 [2022-07-20 05:27:42,252 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:42,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:27:42,906 INFO L93 Difference]: Finished difference Result 261 states and 262 transitions. [2022-07-20 05:27:42,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 05:27:42,907 INFO L78 Accepts]: Start accepts. Automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 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 166 [2022-07-20 05:27:42,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:27:42,908 INFO L225 Difference]: With dead ends: 261 [2022-07-20 05:27:42,908 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 05:27:42,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 397 GetRequests, 267 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4273 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3442, Invalid=13588, Unknown=0, NotChecked=0, Total=17030 [2022-07-20 05:27:42,909 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 177 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 930 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 05:27:42,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 308 Invalid, 930 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 905 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 05:27:42,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 05:27:42,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 175. [2022-07-20 05:27:42,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 173 states have (on average 1.0173410404624277) internal successors, (176), 174 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-20 05:27:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2022-07-20 05:27:42,912 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 166 [2022-07-20 05:27:42,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:27:42,912 INFO L495 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2022-07-20 05:27:42,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 109 states, 109 states have (on average 3.7522935779816513) internal successors, (409), 109 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:27:42,912 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2022-07-20 05:27:42,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-20 05:27:42,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:27:42,913 INFO L195 NwaCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:27:42,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-07-20 05:27:43,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-07-20 05:27:43,117 INFO L420 AbstractCegarLoop]: === Iteration 59 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:27:43,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:27:43,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1922890399, now seen corresponding path program 15 times [2022-07-20 05:27:43,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:27:43,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098989827] [2022-07-20 05:27:43,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:27:43,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:27:43,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:27:43,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 630 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:27:43,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:27:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098989827] [2022-07-20 05:27:43,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098989827] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:27:43,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21103951] [2022-07-20 05:27:43,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 05:27:43,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:27:43,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:27:43,890 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:27:43,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-07-20 05:28:00,424 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 21 check-sat command(s) [2022-07-20 05:28:00,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 05:28:00,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 827 conjuncts, 111 conjunts are in the unsatisfiable core [2022-07-20 05:28:00,461 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 05:28:00,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-20 05:28:00,467 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2022-07-20 05:28:02,076 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 703 proven. 877 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:02,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 05:28:04,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1580 backedges. 780 proven. 800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:04,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21103951] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 05:28:04,019 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 05:28:04,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 44, 44] total 129 [2022-07-20 05:28:04,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976465908] [2022-07-20 05:28:04,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 05:28:04,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 130 states [2022-07-20 05:28:04,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 05:28:04,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2022-07-20 05:28:04,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2157, Invalid=14613, Unknown=0, NotChecked=0, Total=16770 [2022-07-20 05:28:04,024 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 05:28:06,159 INFO L93 Difference]: Finished difference Result 178 states and 179 transitions. [2022-07-20 05:28:06,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-20 05:28:06,159 INFO L78 Accepts]: Start accepts. Automaton has has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 0 states have call successors, (0), 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 170 [2022-07-20 05:28:06,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 05:28:06,160 INFO L225 Difference]: With dead ends: 178 [2022-07-20 05:28:06,160 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 05:28:06,161 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 424 GetRequests, 253 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6627 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=5454, Invalid=24302, Unknown=0, NotChecked=0, Total=29756 [2022-07-20 05:28:06,162 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 1070 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 2310 mSolverCounterSat, 319 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1070 SdHoareTripleChecker+Valid, 800 SdHoareTripleChecker+Invalid, 2629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 319 IncrementalHoareTripleChecker+Valid, 2310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 05:28:06,162 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1070 Valid, 800 Invalid, 2629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [319 Valid, 2310 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 05:28:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 05:28:06,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2022-07-20 05:28:06,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 174 states have (on average 1.0172413793103448) internal successors, (177), 175 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:06,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 177 transitions. [2022-07-20 05:28:06,164 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 177 transitions. Word has length 170 [2022-07-20 05:28:06,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 05:28:06,164 INFO L495 AbstractCegarLoop]: Abstraction has 176 states and 177 transitions. [2022-07-20 05:28:06,164 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 130 states, 129 states have (on average 3.891472868217054) internal successors, (502), 130 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 05:28:06,164 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 177 transitions. [2022-07-20 05:28:06,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-07-20 05:28:06,165 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 05:28:06,165 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 21, 21, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 05:28:06,210 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-07-20 05:28:06,385 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-07-20 05:28:06,386 INFO L420 AbstractCegarLoop]: === Iteration 60 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 6 more)] === [2022-07-20 05:28:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 05:28:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1445923345, now seen corresponding path program 29 times [2022-07-20 05:28:06,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 05:28:06,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679538939] [2022-07-20 05:28:06,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 05:28:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 05:28:06,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 05:28:07,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1641 backedges. 41 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 05:28:07,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 05:28:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679538939] [2022-07-20 05:28:07,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679538939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 05:28:07,660 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247105259] [2022-07-20 05:28:07,661 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-20 05:28:07,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 05:28:07,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 05:28:07,662 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 05:28:07,664 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process