./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 791161d1 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_cstpncpy-alloca-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 05:39:17,441 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 05:39:17,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 05:39:17,471 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 05:39:17,472 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 05:39:17,473 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 05:39:17,474 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 05:39:17,475 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 05:39:17,477 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 05:39:17,478 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 05:39:17,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 05:39:17,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 05:39:17,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 05:39:17,481 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 05:39:17,482 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 05:39:17,483 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 05:39:17,484 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 05:39:17,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 05:39:17,486 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 05:39:17,487 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 05:39:17,489 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 05:39:17,490 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 05:39:17,490 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 05:39:17,491 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 05:39:17,492 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 05:39:17,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 05:39:17,495 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 05:39:17,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 05:39:17,496 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 05:39:17,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 05:39:17,498 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 05:39:17,498 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 05:39:17,499 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 05:39:17,499 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 05:39:17,500 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 05:39:17,501 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 05:39:17,501 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 05:39:17,502 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 05:39:17,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 05:39:17,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 05:39:17,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 05:39:17,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 05:39:17,505 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-23 05:39:17,524 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 05:39:17,524 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 05:39:17,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 05:39:17,525 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 05:39:17,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 05:39:17,526 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 05:39:17,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 05:39:17,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 05:39:17,527 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 05:39:17,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 05:39:17,527 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-23 05:39:17,527 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-23 05:39:17,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 05:39:17,528 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-23 05:39:17,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 05:39:17,528 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-23 05:39:17,529 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-23 05:39:17,529 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-23 05:39:17,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 05:39:17,529 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-23 05:39:17,530 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-23 05:39:17,530 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 05:39:17,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 05:39:17,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 05:39:17,531 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 05:39:17,531 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:39:17,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 05:39:17,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 05:39:17,532 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 05:39:17,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 05:39:17,532 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 -> 36c3a12d89778d96e6058a4f11ff4e1483403bd2fab9b14de640491057c7f753 [2022-07-23 05:39:17,714 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 05:39:17,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 05:39:17,769 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 05:39:17,770 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 05:39:17,770 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 05:39:17,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-23 05:39:17,824 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc85f7997/7219b2b6b09a458497359fce3036c89a/FLAGc205f1fd6 [2022-07-23 05:39:18,281 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 05:39:18,282 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstpncpy-alloca-1.i [2022-07-23 05:39:18,291 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc85f7997/7219b2b6b09a458497359fce3036c89a/FLAGc205f1fd6 [2022-07-23 05:39:18,634 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc85f7997/7219b2b6b09a458497359fce3036c89a [2022-07-23 05:39:18,636 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 05:39:18,637 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 05:39:18,639 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 05:39:18,639 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 05:39:18,648 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 05:39:18,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:39:18" (1/1) ... [2022-07-23 05:39:18,649 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@122dcc75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:18, skipping insertion in model container [2022-07-23 05:39:18,650 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 05:39:18" (1/1) ... [2022-07-23 05:39:18,656 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 05:39:18,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 05:39:18,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:39:18,996 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 05:39:19,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 05:39:19,101 INFO L208 MainTranslator]: Completed translation [2022-07-23 05:39:19,101 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19 WrapperNode [2022-07-23 05:39:19,101 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 05:39:19,103 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 05:39:19,103 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 05:39:19,104 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 05:39:19,111 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,138 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,160 INFO L137 Inliner]: procedures = 119, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-07-23 05:39:19,160 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 05:39:19,161 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 05:39:19,161 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 05:39:19,161 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 05:39:19,168 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,168 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,181 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,184 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,194 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,197 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 05:39:19,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 05:39:19,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 05:39:19,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 05:39:19,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (1/1) ... [2022-07-23 05:39:19,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 05:39:19,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:19,235 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-23 05:39:19,237 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-23 05:39:19,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-23 05:39:19,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 05:39:19,265 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 05:39:19,343 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 05:39:19,345 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 05:39:19,623 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 05:39:19,632 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 05:39:19,633 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-23 05:39:19,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:39:19 BoogieIcfgContainer [2022-07-23 05:39:19,635 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 05:39:19,640 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 05:39:19,641 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 05:39:19,644 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 05:39:19,645 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 05:39:18" (1/3) ... [2022-07-23 05:39:19,646 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79555d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:39:19, skipping insertion in model container [2022-07-23 05:39:19,646 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 05:39:19" (2/3) ... [2022-07-23 05:39:19,647 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5f79555d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 05:39:19, skipping insertion in model container [2022-07-23 05:39:19,647 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 05:39:19" (3/3) ... [2022-07-23 05:39:19,648 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstpncpy-alloca-1.i [2022-07-23 05:39:19,666 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 05:39:19,666 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 23 error locations. [2022-07-23 05:39:19,703 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 05:39:19,709 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@397bbe5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@d0fcb4f [2022-07-23 05:39:19,710 INFO L358 AbstractCegarLoop]: Starting to check reachability of 23 error locations. [2022-07-23 05:39:19,713 INFO L276 IsEmpty]: Start isEmpty. Operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:19,723 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:19,723 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:19,724 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:19,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:19,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-23 05:39:19,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:19,734 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516560768] [2022-07-23 05:39:19,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:19,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:19,998 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-23 05:39:19,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:19,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516560768] [2022-07-23 05:39:20,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516560768] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:20,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444418744] [2022-07-23 05:39:20,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,006 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:39:20,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:39:20,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:20,036 INFO L87 Difference]: Start difference. First operand has 59 states, 35 states have (on average 1.9428571428571428) internal successors, (68), 58 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:20,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,197 INFO L93 Difference]: Finished difference Result 111 states and 122 transitions. [2022-07-23 05:39:20,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:39:20,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-23 05:39:20,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,208 INFO L225 Difference]: With dead ends: 111 [2022-07-23 05:39:20,208 INFO L226 Difference]: Without dead ends: 107 [2022-07-23 05:39:20,210 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:20,213 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 106 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:20,214 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:20,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-23 05:39:20,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 55. [2022-07-23 05:39:20,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 54 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-23 05:39:20,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-07-23 05:39:20,255 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 7 [2022-07-23 05:39:20,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,255 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-07-23 05:39:20,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:20,256 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-07-23 05:39:20,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:20,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 05:39:20,258 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-23 05:39:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436804906] [2022-07-23 05:39:20,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:20,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436804906] [2022-07-23 05:39:20,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436804906] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:20,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746684049] [2022-07-23 05:39:20,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:20,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:20,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:20,333 INFO L87 Difference]: Start difference. First operand 55 states and 61 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-23 05:39:20,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,372 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2022-07-23 05:39:20,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:20,372 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-23 05:39:20,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,373 INFO L225 Difference]: With dead ends: 54 [2022-07-23 05:39:20,373 INFO L226 Difference]: Without dead ends: 54 [2022-07-23 05:39:20,374 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-23 05:39:20,375 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 60 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:20,376 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 83 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:20,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-23 05:39:20,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2022-07-23 05:39:20,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 53 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2022-07-23 05:39:20,391 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 7 [2022-07-23 05:39:20,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,392 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2022-07-23 05:39:20,392 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-23 05:39:20,393 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2022-07-23 05:39:20,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:20,393 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,394 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 05:39:20,396 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-23 05:39:20,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829120754] [2022-07-23 05:39:20,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,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-23 05:39:20,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829120754] [2022-07-23 05:39:20,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829120754] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:20,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58442721] [2022-07-23 05:39:20,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:20,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:20,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:20,446 INFO L87 Difference]: Start difference. First operand 54 states and 60 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-23 05:39:20,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,460 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-07-23 05:39:20,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:20,461 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-23 05:39:20,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,462 INFO L225 Difference]: With dead ends: 101 [2022-07-23 05:39:20,462 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 05:39:20,463 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-23 05:39:20,464 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 98 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 112 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-23 05:39:20,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 112 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 05:39:20,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 57. [2022-07-23 05:39:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 37 states have (on average 1.7297297297297298) internal successors, (64), 56 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-23 05:39:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-07-23 05:39:20,469 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 7 [2022-07-23 05:39:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,470 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-07-23 05:39:20,470 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-23 05:39:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-07-23 05:39:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-23 05:39:20,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,471 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 05:39:20,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,472 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-23 05:39:20,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272008554] [2022-07-23 05:39:20,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,521 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-23 05:39:20,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272008554] [2022-07-23 05:39:20,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272008554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-23 05:39:20,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849809600] [2022-07-23 05:39:20,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-23 05:39:20,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-23 05:39:20,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-23 05:39:20,524 INFO L87 Difference]: Start difference. First operand 57 states and 64 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-23 05:39:20,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,615 INFO L93 Difference]: Finished difference Result 105 states and 116 transitions. [2022-07-23 05:39:20,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-23 05:39:20,615 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-23 05:39:20,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,616 INFO L225 Difference]: With dead ends: 105 [2022-07-23 05:39:20,616 INFO L226 Difference]: Without dead ends: 105 [2022-07-23 05:39:20,617 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-23 05:39:20,617 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:20,618 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 69 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:20,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-23 05:39:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 59. [2022-07-23 05:39:20,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 39 states have (on average 1.7179487179487178) internal successors, (67), 58 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:20,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2022-07-23 05:39:20,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 7 [2022-07-23 05:39:20,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,623 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2022-07-23 05:39:20,623 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-23 05:39:20,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2022-07-23 05:39:20,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:39:20,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 05:39:20,624 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,625 INFO L85 PathProgramCache]: Analyzing trace with hash -533877068, now seen corresponding path program 1 times [2022-07-23 05:39:20,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912204383] [2022-07-23 05:39:20,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,655 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-23 05:39:20,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912204383] [2022-07-23 05:39:20,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912204383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:39:20,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207392889] [2022-07-23 05:39:20,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:39:20,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:39:20,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:39:20,658 INFO L87 Difference]: Start difference. First operand 59 states and 67 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,698 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-23 05:39:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:39:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,700 INFO L225 Difference]: With dead ends: 53 [2022-07-23 05:39:20,700 INFO L226 Difference]: Without dead ends: 53 [2022-07-23 05:39:20,701 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-23 05:39:20,702 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 36 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 44 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-23 05:39:20,703 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 44 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:20,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-23 05:39:20,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-07-23 05:39:20,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.564102564102564) internal successors, (61), 52 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-23 05:39:20,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 61 transitions. [2022-07-23 05:39:20,706 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 61 transitions. Word has length 9 [2022-07-23 05:39:20,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,707 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 61 transitions. [2022-07-23 05:39:20,707 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,707 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 61 transitions. [2022-07-23 05:39:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-23 05:39:20,708 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,708 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 05:39:20,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash -533877067, now seen corresponding path program 1 times [2022-07-23 05:39:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455673407] [2022-07-23 05:39:20,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,746 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-23 05:39:20,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455673407] [2022-07-23 05:39:20,747 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455673407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:20,747 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:20,747 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-23 05:39:20,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358733692] [2022-07-23 05:39:20,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:20,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-23 05:39:20,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:20,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-23 05:39:20,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-23 05:39:20,749 INFO L87 Difference]: Start difference. First operand 53 states and 61 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:20,775 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-23 05:39:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-23 05:39:20,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:20,776 INFO L225 Difference]: With dead ends: 47 [2022-07-23 05:39:20,776 INFO L226 Difference]: Without dead ends: 47 [2022-07-23 05:39:20,776 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-23 05:39:20,777 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 30 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:20,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:20,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-23 05:39:20,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-07-23 05:39:20,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 39 states have (on average 1.4102564102564104) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:20,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-23 05:39:20,785 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 9 [2022-07-23 05:39:20,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:20,785 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-23 05:39:20,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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-23 05:39:20,785 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-23 05:39:20,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-23 05:39:20,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:20,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:20,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 05:39:20,787 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:20,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:20,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-23 05:39:20,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:20,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103035960] [2022-07-23 05:39:20,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:20,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,863 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-23 05:39:20,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:20,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103035960] [2022-07-23 05:39:20,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103035960] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:20,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188305424] [2022-07-23 05:39:20,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:20,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:20,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:20,867 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-23 05:39:20,878 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-23 05:39:20,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:20,939 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-23 05:39:20,947 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:21,037 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:21,038 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-23 05:39:21,137 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-23 05:39:21,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:21,312 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-23 05:39:21,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188305424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:21,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:21,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-23 05:39:21,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845151281] [2022-07-23 05:39:21,313 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:21,314 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 05:39:21,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:21,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 05:39:21,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-23 05:39:21,315 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:21,479 INFO L93 Difference]: Finished difference Result 83 states and 95 transitions. [2022-07-23 05:39:21,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 05:39:21,480 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-23 05:39:21,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:21,480 INFO L225 Difference]: With dead ends: 83 [2022-07-23 05:39:21,481 INFO L226 Difference]: Without dead ends: 83 [2022-07-23 05:39:21,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-07-23 05:39:21,482 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 62 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:21,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 128 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:21,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-07-23 05:39:21,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 44. [2022-07-23 05:39:21,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3783783783783783) internal successors, (51), 43 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 51 transitions. [2022-07-23 05:39:21,486 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 51 transitions. Word has length 11 [2022-07-23 05:39:21,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:21,487 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 51 transitions. [2022-07-23 05:39:21,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,487 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 51 transitions. [2022-07-23 05:39:21,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:39:21,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:21,488 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:21,517 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-23 05:39:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:21,702 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:21,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:21,703 INFO L85 PathProgramCache]: Analyzing trace with hash 229648597, now seen corresponding path program 1 times [2022-07-23 05:39:21,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:21,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134309689] [2022-07-23 05:39:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:21,786 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-23 05:39:21,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:21,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134309689] [2022-07-23 05:39:21,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134309689] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:21,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:21,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 05:39:21,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147802587] [2022-07-23 05:39:21,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:21,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:39:21,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:21,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:39:21,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:21,791 INFO L87 Difference]: Start difference. First operand 44 states and 51 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:21,830 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2022-07-23 05:39:21,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-23 05:39:21,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:39:21,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:21,832 INFO L225 Difference]: With dead ends: 94 [2022-07-23 05:39:21,832 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 05:39:21,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-23 05:39:21,833 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 104 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:21,834 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 183 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:21,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 05:39:21,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 56. [2022-07-23 05:39:21,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 55 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-23 05:39:21,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-07-23 05:39:21,837 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 15 [2022-07-23 05:39:21,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:21,838 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-07-23 05:39:21,838 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,838 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-07-23 05:39:21,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-23 05:39:21,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:21,839 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:21,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 05:39:21,839 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:21,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:21,840 INFO L85 PathProgramCache]: Analyzing trace with hash 487814035, now seen corresponding path program 1 times [2022-07-23 05:39:21,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:21,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976143903] [2022-07-23 05:39:21,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:21,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:21,904 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-23 05:39:21,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:21,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976143903] [2022-07-23 05:39:21,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976143903] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:21,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:21,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:39:21,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886020587] [2022-07-23 05:39:21,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:21,905 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:39:21,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:21,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:39:21,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:39:21,906 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:21,942 INFO L93 Difference]: Finished difference Result 67 states and 75 transitions. [2022-07-23 05:39:21,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:39:21,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-23 05:39:21,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:21,943 INFO L225 Difference]: With dead ends: 67 [2022-07-23 05:39:21,943 INFO L226 Difference]: Without dead ends: 67 [2022-07-23 05:39:21,943 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 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-23 05:39:21,944 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 156 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:21,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-23 05:39:21,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 44. [2022-07-23 05:39:21,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-23 05:39:21,948 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 15 [2022-07-23 05:39:21,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:21,949 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-23 05:39:21,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:21,949 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-23 05:39:21,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:39:21,950 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:21,950 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:21,950 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 05:39:21,950 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:21,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:21,951 INFO L85 PathProgramCache]: Analyzing trace with hash -994678340, now seen corresponding path program 1 times [2022-07-23 05:39:21,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:21,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235755612] [2022-07-23 05:39:21,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:21,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:21,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:22,058 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-23 05:39:22,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:22,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235755612] [2022-07-23 05:39:22,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235755612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:22,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:22,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 05:39:22,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938749300] [2022-07-23 05:39:22,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:22,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 05:39:22,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:22,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 05:39:22,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-23 05:39:22,061 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:22,162 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-07-23 05:39:22,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 05:39:22,163 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:39:22,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:22,163 INFO L225 Difference]: With dead ends: 43 [2022-07-23 05:39:22,163 INFO L226 Difference]: Without dead ends: 43 [2022-07-23 05:39:22,164 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:39:22,164 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 131 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:22,165 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 73 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:22,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-23 05:39:22,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-23 05:39:22,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 42 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-23 05:39:22,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2022-07-23 05:39:22,167 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 18 [2022-07-23 05:39:22,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:22,168 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2022-07-23 05:39:22,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,168 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-07-23 05:39:22,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-23 05:39:22,168 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:22,169 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:22,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 05:39:22,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:22,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:22,170 INFO L85 PathProgramCache]: Analyzing trace with hash -994678339, now seen corresponding path program 1 times [2022-07-23 05:39:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:22,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34782551] [2022-07-23 05:39:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:22,266 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-23 05:39:22,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:22,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34782551] [2022-07-23 05:39:22,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34782551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:22,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:22,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:39:22,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034316731] [2022-07-23 05:39:22,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:22,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:39:22,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:22,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:39:22,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:39:22,269 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:22,431 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2022-07-23 05:39:22,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 05:39:22,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-23 05:39:22,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:22,432 INFO L225 Difference]: With dead ends: 49 [2022-07-23 05:39:22,432 INFO L226 Difference]: Without dead ends: 49 [2022-07-23 05:39:22,433 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:39:22,433 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 157 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:22,434 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 86 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:22,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-23 05:39:22,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 45. [2022-07-23 05:39:22,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-23 05:39:22,436 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 18 [2022-07-23 05:39:22,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:22,437 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-23 05:39:22,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,437 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-23 05:39:22,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:39:22,438 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:22,438 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:22,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-23 05:39:22,438 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:22,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:22,439 INFO L85 PathProgramCache]: Analyzing trace with hash -770257435, now seen corresponding path program 1 times [2022-07-23 05:39:22,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:22,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607027430] [2022-07-23 05:39:22,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:22,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:22,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:22,566 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-23 05:39:22,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:22,567 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607027430] [2022-07-23 05:39:22,567 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607027430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:22,567 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:22,567 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 05:39:22,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971505769] [2022-07-23 05:39:22,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:22,568 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-23 05:39:22,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:22,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-23 05:39:22,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:39:22,569 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:22,721 INFO L93 Difference]: Finished difference Result 48 states and 55 transitions. [2022-07-23 05:39:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-23 05:39:22,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 05:39:22,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:22,722 INFO L225 Difference]: With dead ends: 48 [2022-07-23 05:39:22,722 INFO L226 Difference]: Without dead ends: 48 [2022-07-23 05:39:22,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-07-23 05:39:22,723 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 79 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:22,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 155 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:22,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-07-23 05:39:22,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-07-23 05:39:22,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.325) internal successors, (53), 45 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-23 05:39:22,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 53 transitions. [2022-07-23 05:39:22,725 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 53 transitions. Word has length 19 [2022-07-23 05:39:22,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:22,725 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 53 transitions. [2022-07-23 05:39:22,725 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:22,725 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 53 transitions. [2022-07-23 05:39:22,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-23 05:39:22,726 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:22,726 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:22,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-23 05:39:22,726 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:22,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:22,726 INFO L85 PathProgramCache]: Analyzing trace with hash -770257436, now seen corresponding path program 1 times [2022-07-23 05:39:22,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:22,726 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042846598] [2022-07-23 05:39:22,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:22,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:22,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:22,942 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-23 05:39:22,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:22,942 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042846598] [2022-07-23 05:39:22,943 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042846598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:22,943 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:22,943 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 05:39:22,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806526881] [2022-07-23 05:39:22,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:22,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:39:22,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:22,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:39:22,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:39:22,945 INFO L87 Difference]: Start difference. First operand 46 states and 53 transitions. Second operand has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:23,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:23,482 INFO L93 Difference]: Finished difference Result 85 states and 94 transitions. [2022-07-23 05:39:23,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-23 05:39:23,482 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-23 05:39:23,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:23,483 INFO L225 Difference]: With dead ends: 85 [2022-07-23 05:39:23,483 INFO L226 Difference]: Without dead ends: 85 [2022-07-23 05:39:23,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=230, Invalid=640, Unknown=0, NotChecked=0, Total=870 [2022-07-23 05:39:23,484 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 244 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:23,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 157 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:23,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-23 05:39:23,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 45. [2022-07-23 05:39:23,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.275) internal successors, (51), 44 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:23,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 51 transitions. [2022-07-23 05:39:23,487 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 51 transitions. Word has length 19 [2022-07-23 05:39:23,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:23,487 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 51 transitions. [2022-07-23 05:39:23,488 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:23,488 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-07-23 05:39:23,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:23,488 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:23,489 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:23,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 05:39:23,489 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807689, now seen corresponding path program 1 times [2022-07-23 05:39:23,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:23,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920684189] [2022-07-23 05:39:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:23,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:23,526 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-23 05:39:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:23,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920684189] [2022-07-23 05:39:23,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920684189] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:23,526 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:23,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-23 05:39:23,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669637055] [2022-07-23 05:39:23,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:23,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 05:39:23,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:23,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 05:39:23,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 05:39:23,528 INFO L87 Difference]: Start difference. First operand 45 states and 51 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-23 05:39:23,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:23,576 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-07-23 05:39:23,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:39:23,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:23,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:23,577 INFO L225 Difference]: With dead ends: 44 [2022-07-23 05:39:23,578 INFO L226 Difference]: Without dead ends: 44 [2022-07-23 05:39:23,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:23,578 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:23,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 95 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:23,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-07-23 05:39:23,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-07-23 05:39:23,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 40 states have (on average 1.25) internal successors, (50), 43 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:23,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-07-23 05:39:23,581 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 24 [2022-07-23 05:39:23,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:23,581 INFO L495 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-07-23 05:39:23,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 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-23 05:39:23,582 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-07-23 05:39:23,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:23,582 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:23,582 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:23,582 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-23 05:39:23,583 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:23,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:23,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1682807690, now seen corresponding path program 1 times [2022-07-23 05:39:23,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:23,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950451424] [2022-07-23 05:39:23,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:23,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:23,656 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-23 05:39:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:23,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950451424] [2022-07-23 05:39:23,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950451424] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:23,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:23,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:39:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060410895] [2022-07-23 05:39:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:23,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:39:23,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:39:23,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:39:23,659 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-23 05:39:23,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:23,729 INFO L93 Difference]: Finished difference Result 88 states and 98 transitions. [2022-07-23 05:39:23,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:39:23,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:23,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:23,730 INFO L225 Difference]: With dead ends: 88 [2022-07-23 05:39:23,730 INFO L226 Difference]: Without dead ends: 88 [2022-07-23 05:39:23,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:39:23,732 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 75 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:23,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 199 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:23,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-07-23 05:39:23,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 68. [2022-07-23 05:39:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 64 states have (on average 1.1875) internal successors, (76), 67 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-23 05:39:23,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-07-23 05:39:23,737 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 24 [2022-07-23 05:39:23,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:23,738 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-07-23 05:39:23,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-23 05:39:23,739 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-07-23 05:39:23,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:23,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:23,743 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:23,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 05:39:23,744 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:23,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:23,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1703829822, now seen corresponding path program 1 times [2022-07-23 05:39:23,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:23,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958193645] [2022-07-23 05:39:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:23,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:23,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:23,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:23,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:23,844 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958193645] [2022-07-23 05:39:23,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [958193645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:23,844 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:23,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:39:23,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658267912] [2022-07-23 05:39:23,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:23,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 05:39:23,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:23,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 05:39:23,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 05:39:23,846 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-23 05:39:23,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:23,907 INFO L93 Difference]: Finished difference Result 75 states and 82 transitions. [2022-07-23 05:39:23,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:39:23,907 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:23,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:23,908 INFO L225 Difference]: With dead ends: 75 [2022-07-23 05:39:23,908 INFO L226 Difference]: Without dead ends: 75 [2022-07-23 05:39:23,908 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-07-23 05:39:23,909 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 44 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:23,909 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 182 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:23,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-23 05:39:23,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 70. [2022-07-23 05:39:23,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 66 states have (on average 1.1818181818181819) internal successors, (78), 69 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:23,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 78 transitions. [2022-07-23 05:39:23,912 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 78 transitions. Word has length 24 [2022-07-23 05:39:23,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:23,912 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 78 transitions. [2022-07-23 05:39:23,912 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 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-23 05:39:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 78 transitions. [2022-07-23 05:39:23,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:23,913 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:23,913 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:23,913 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-23 05:39:23,913 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:23,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:23,914 INFO L85 PathProgramCache]: Analyzing trace with hash 2105509516, now seen corresponding path program 1 times [2022-07-23 05:39:23,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:23,914 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788038807] [2022-07-23 05:39:23,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:23,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:23,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:24,265 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-23 05:39:24,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:24,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788038807] [2022-07-23 05:39:24,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788038807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:24,266 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:24,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 05:39:24,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402491731] [2022-07-23 05:39:24,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:24,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-23 05:39:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:24,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-23 05:39:24,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2022-07-23 05:39:24,267 INFO L87 Difference]: Start difference. First operand 70 states and 78 transitions. Second operand has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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-23 05:39:24,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:24,808 INFO L93 Difference]: Finished difference Result 77 states and 87 transitions. [2022-07-23 05:39:24,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:39:24,808 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:24,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:24,810 INFO L225 Difference]: With dead ends: 77 [2022-07-23 05:39:24,810 INFO L226 Difference]: Without dead ends: 77 [2022-07-23 05:39:24,811 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2022-07-23 05:39:24,811 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 90 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:24,811 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 165 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 05:39:24,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-07-23 05:39:24,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-07-23 05:39:24,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 74 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:24,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 85 transitions. [2022-07-23 05:39:24,814 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 85 transitions. Word has length 24 [2022-07-23 05:39:24,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:24,814 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 85 transitions. [2022-07-23 05:39:24,815 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.8461538461538463) internal successors, (24), 14 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-23 05:39:24,815 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 85 transitions. [2022-07-23 05:39:24,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:24,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:24,815 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:24,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 05:39:24,816 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:24,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:24,816 INFO L85 PathProgramCache]: Analyzing trace with hash 2126531648, now seen corresponding path program 1 times [2022-07-23 05:39:24,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:24,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409054574] [2022-07-23 05:39:24,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:24,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:24,990 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:24,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:24,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409054574] [2022-07-23 05:39:24,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409054574] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:24,991 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:24,991 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 05:39:24,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361564056] [2022-07-23 05:39:24,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:24,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 05:39:24,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:24,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 05:39:24,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2022-07-23 05:39:24,993 INFO L87 Difference]: Start difference. First operand 75 states and 85 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-23 05:39:25,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:25,229 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-07-23 05:39:25,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 05:39:25,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:25,231 INFO L225 Difference]: With dead ends: 120 [2022-07-23 05:39:25,231 INFO L226 Difference]: Without dead ends: 120 [2022-07-23 05:39:25,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2022-07-23 05:39:25,232 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 61 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:25,232 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 253 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:25,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-23 05:39:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2022-07-23 05:39:25,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 99 states have (on average 1.1414141414141414) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:25,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2022-07-23 05:39:25,234 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 24 [2022-07-23 05:39:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:25,235 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2022-07-23 05:39:25,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 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-23 05:39:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2022-07-23 05:39:25,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-23 05:39:25,235 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:25,236 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:25,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-23 05:39:25,236 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:25,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:25,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1949580930, now seen corresponding path program 1 times [2022-07-23 05:39:25,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:25,236 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490150813] [2022-07-23 05:39:25,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:25,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:25,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:25,397 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:25,397 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:25,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490150813] [2022-07-23 05:39:25,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490150813] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:25,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:25,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-23 05:39:25,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934747183] [2022-07-23 05:39:25,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:25,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-23 05:39:25,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:25,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-23 05:39:25,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-07-23 05:39:25,399 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-23 05:39:25,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:25,658 INFO L93 Difference]: Finished difference Result 156 states and 169 transitions. [2022-07-23 05:39:25,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 05:39:25,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-23 05:39:25,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:25,659 INFO L225 Difference]: With dead ends: 156 [2022-07-23 05:39:25,659 INFO L226 Difference]: Without dead ends: 156 [2022-07-23 05:39:25,660 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-23 05:39:25,660 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 100 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:25,660 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 188 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-23 05:39:25,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-07-23 05:39:25,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 105. [2022-07-23 05:39:25,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 101 states have (on average 1.1584158415841583) internal successors, (117), 104 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-23 05:39:25,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 117 transitions. [2022-07-23 05:39:25,663 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 117 transitions. Word has length 24 [2022-07-23 05:39:25,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:25,663 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 117 transitions. [2022-07-23 05:39:25,663 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.0) internal successors, (24), 12 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-23 05:39:25,663 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 117 transitions. [2022-07-23 05:39:25,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-23 05:39:25,664 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:25,664 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:25,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-23 05:39:25,664 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:25,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:25,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1664467980, now seen corresponding path program 1 times [2022-07-23 05:39:25,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:25,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504837249] [2022-07-23 05:39:25,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:25,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:25,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:25,870 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-23 05:39:25,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:25,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504837249] [2022-07-23 05:39:25,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504837249] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 05:39:25,870 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 05:39:25,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 05:39:25,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498239399] [2022-07-23 05:39:25,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 05:39:25,871 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 05:39:25,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:25,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 05:39:25,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:25,872 INFO L87 Difference]: Start difference. First operand 105 states and 117 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-23 05:39:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:25,927 INFO L93 Difference]: Finished difference Result 104 states and 116 transitions. [2022-07-23 05:39:25,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 05:39:25,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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) Word has length 27 [2022-07-23 05:39:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:25,929 INFO L225 Difference]: With dead ends: 104 [2022-07-23 05:39:25,929 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:39:25,929 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-23 05:39:25,930 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:25,930 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 77 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 05:39:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:39:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2022-07-23 05:39:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 56 states have (on average 1.1428571428571428) internal successors, (64), 58 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-23 05:39:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 64 transitions. [2022-07-23 05:39:25,932 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 64 transitions. Word has length 27 [2022-07-23 05:39:25,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:25,933 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 64 transitions. [2022-07-23 05:39:25,933 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 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-23 05:39:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 64 transitions. [2022-07-23 05:39:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 05:39:25,933 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:25,934 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:25,934 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 05:39:25,934 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:25,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:25,935 INFO L85 PathProgramCache]: Analyzing trace with hash 235701316, now seen corresponding path program 1 times [2022-07-23 05:39:25,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:25,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875927442] [2022-07-23 05:39:25,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:25,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:25,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:26,388 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-23 05:39:26,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:26,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875927442] [2022-07-23 05:39:26,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875927442] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:26,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1623422271] [2022-07-23 05:39:26,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:26,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:26,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:26,391 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-23 05:39:26,419 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-23 05:39:26,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:26,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-23 05:39:26,534 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:26,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:26,560 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:39:26,572 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:39:26,572 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:39:26,622 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:26,622 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:39:26,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:39:26,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:26,664 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 11 treesize of output 7 [2022-07-23 05:39:26,749 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 25 treesize of output 13 [2022-07-23 05:39:26,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:39:27,279 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-23 05:39:27,279 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:28,059 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-23 05:39:28,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1623422271] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:28,060 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:28,060 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 41 [2022-07-23 05:39:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239730197] [2022-07-23 05:39:28,062 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:28,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 05:39:28,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:28,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 05:39:28,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1574, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 05:39:28,066 INFO L87 Difference]: Start difference. First operand 59 states and 64 transitions. Second operand has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 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-23 05:39:28,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:28,517 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2022-07-23 05:39:28,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:39:28,518 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 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) Word has length 28 [2022-07-23 05:39:28,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:28,519 INFO L225 Difference]: With dead ends: 68 [2022-07-23 05:39:28,519 INFO L226 Difference]: Without dead ends: 68 [2022-07-23 05:39:28,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 525 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=237, Invalid=2213, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 05:39:28,520 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 48 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:28,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 230 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 171 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-07-23 05:39:28,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-23 05:39:28,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2022-07-23 05:39:28,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 64 states have (on average 1.125) internal successors, (72), 66 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:28,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2022-07-23 05:39:28,523 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 28 [2022-07-23 05:39:28,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:28,523 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2022-07-23 05:39:28,523 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.853658536585366) internal successors, (76), 42 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-23 05:39:28,523 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2022-07-23 05:39:28,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-23 05:39:28,524 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:28,524 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:28,545 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 05:39:28,724 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,SelfDestructingSolverStorable20 [2022-07-23 05:39:28,725 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:28,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:28,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1959516773, now seen corresponding path program 1 times [2022-07-23 05:39:28,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:28,725 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057905926] [2022-07-23 05:39:28,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:28,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:28,925 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-23 05:39:28,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057905926] [2022-07-23 05:39:28,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057905926] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:28,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398789811] [2022-07-23 05:39:28,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:28,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:28,928 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-23 05:39:28,930 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-23 05:39:29,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:29,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 32 conjunts are in the unsatisfiable core [2022-07-23 05:39:29,028 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:29,094 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:29,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:39:29,101 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:29,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:39:29,190 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-23 05:39:29,190 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:29,419 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 27 treesize of output 23 [2022-07-23 05:39:29,493 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:39:29,494 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-07-23 05:39:29,506 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-23 05:39:29,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398789811] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:29,506 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:29,506 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 28 [2022-07-23 05:39:29,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740250642] [2022-07-23 05:39:29,507 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:29,507 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-23 05:39:29,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:29,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-23 05:39:29,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=712, Unknown=0, NotChecked=0, Total=812 [2022-07-23 05:39:29,509 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:30,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:30,022 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2022-07-23 05:39:30,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 05:39:30,024 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-23 05:39:30,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:30,025 INFO L225 Difference]: With dead ends: 99 [2022-07-23 05:39:30,025 INFO L226 Difference]: Without dead ends: 99 [2022-07-23 05:39:30,026 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=251, Invalid=1155, Unknown=0, NotChecked=0, Total=1406 [2022-07-23 05:39:30,026 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 470 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:30,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 305 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 418 Invalid, 0 Unknown, 36 Unchecked, 0.3s Time] [2022-07-23 05:39:30,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-23 05:39:30,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 71. [2022-07-23 05:39:30,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 68 states have (on average 1.1176470588235294) internal successors, (76), 70 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-23 05:39:30,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2022-07-23 05:39:30,029 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 28 [2022-07-23 05:39:30,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:30,029 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2022-07-23 05:39:30,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.4285714285714284) internal successors, (68), 29 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:30,029 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2022-07-23 05:39:30,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-23 05:39:30,029 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:30,030 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:30,053 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-23 05:39:30,230 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:30,230 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:30,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:30,231 INFO L85 PathProgramCache]: Analyzing trace with hash -615477817, now seen corresponding path program 1 times [2022-07-23 05:39:30,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:30,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089858707] [2022-07-23 05:39:30,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:30,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:30,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:30,579 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:39:30,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:30,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089858707] [2022-07-23 05:39:30,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089858707] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:30,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [491319255] [2022-07-23 05:39:30,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:30,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:30,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:30,581 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-23 05:39:30,582 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-23 05:39:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:30,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-23 05:39:30,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:30,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:30,710 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-23 05:39:30,713 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-23 05:39:30,781 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:30,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-07-23 05:39:30,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:30,842 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:30,939 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 25 treesize of output 13 [2022-07-23 05:39:30,944 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-23 05:39:31,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:39:31,372 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:31,992 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:32,043 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:39:32,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [491319255] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:32,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:32,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 38 [2022-07-23 05:39:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237038631] [2022-07-23 05:39:32,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:32,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-23 05:39:32,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-23 05:39:32,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1350, Unknown=0, NotChecked=0, Total=1482 [2022-07-23 05:39:32,047 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 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-23 05:39:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:32,936 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2022-07-23 05:39:32,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:39:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 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) Word has length 29 [2022-07-23 05:39:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:32,938 INFO L225 Difference]: With dead ends: 72 [2022-07-23 05:39:32,938 INFO L226 Difference]: Without dead ends: 72 [2022-07-23 05:39:32,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=278, Invalid=1978, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 05:39:32,940 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 45 mSDsluCounter, 315 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 92 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:32,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 334 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 202 Invalid, 0 Unknown, 92 Unchecked, 0.1s Time] [2022-07-23 05:39:32,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-23 05:39:32,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-07-23 05:39:32,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 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-23 05:39:32,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2022-07-23 05:39:32,944 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2022-07-23 05:39:32,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:32,944 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2022-07-23 05:39:32,945 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1052631578947367) internal successors, (80), 39 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-23 05:39:32,945 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2022-07-23 05:39:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:39:32,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:32,945 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:32,973 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-23 05:39:33,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:33,159 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:33,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:33,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1510311704, now seen corresponding path program 1 times [2022-07-23 05:39:33,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:33,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738966162] [2022-07-23 05:39:33,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:33,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:33,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:33,667 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-23 05:39:33,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738966162] [2022-07-23 05:39:33,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738966162] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:33,668 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021132649] [2022-07-23 05:39:33,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:33,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:33,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:33,672 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-23 05:39:33,674 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-23 05:39:33,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:33,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 70 conjunts are in the unsatisfiable core [2022-07-23 05:39:33,794 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:33,833 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:33,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, 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-23 05:39:33,850 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:39:33,851 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:39:34,006 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:34,007 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-07-23 05:39:34,030 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:39:34,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:34,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:34,073 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 11 treesize of output 7 [2022-07-23 05:39:34,166 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 25 treesize of output 13 [2022-07-23 05:39:34,175 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:39:34,621 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:34,621 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:35,603 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:35,604 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:35,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021132649] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:35,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:35,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 46 [2022-07-23 05:39:35,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93671550] [2022-07-23 05:39:35,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:35,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-23 05:39:35,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:35,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-23 05:39:35,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2026, Unknown=0, NotChecked=0, Total=2162 [2022-07-23 05:39:35,692 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:39,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:39,555 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-23 05:39:39,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-23 05:39:39,557 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-23 05:39:39,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:39,558 INFO L225 Difference]: With dead ends: 92 [2022-07-23 05:39:39,558 INFO L226 Difference]: Without dead ends: 92 [2022-07-23 05:39:39,559 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 919 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=652, Invalid=5668, Unknown=0, NotChecked=0, Total=6320 [2022-07-23 05:39:39,560 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 259 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 844 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 541 SdHoareTripleChecker+Invalid, 1155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 206 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:39,560 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 541 Invalid, 1155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 844 Invalid, 0 Unknown, 206 Unchecked, 0.6s Time] [2022-07-23 05:39:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-23 05:39:39,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 80. [2022-07-23 05:39:39,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.155844155844156) internal successors, (89), 79 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-23 05:39:39,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 89 transitions. [2022-07-23 05:39:39,562 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 89 transitions. Word has length 34 [2022-07-23 05:39:39,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:39,563 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 89 transitions. [2022-07-23 05:39:39,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.0869565217391304) internal successors, (96), 47 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-07-23 05:39:39,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-23 05:39:39,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:39,564 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:39,585 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-23 05:39:39,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-23 05:39:39,776 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:39,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:39,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1489289572, now seen corresponding path program 2 times [2022-07-23 05:39:39,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:39,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683169535] [2022-07-23 05:39:39,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:39,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:39,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:40,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:40,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683169535] [2022-07-23 05:39:40,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683169535] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:40,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [295812149] [2022-07-23 05:39:40,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:40,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:40,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:40,196 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 05:39:40,223 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-23 05:39:40,336 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:40,336 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:40,339 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 05:39:40,342 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:40,353 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:39:40,353 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:39:40,470 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-23 05:39:40,519 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:40,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:39:40,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 17 treesize of output 19 [2022-07-23 05:39:40,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, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:40,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:39:40,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:39:40,823 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:39:40,836 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-23 05:39:40,841 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:40,841 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:40,866 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:39:40,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_916 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:40,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:40,905 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)))) is different from false [2022-07-23 05:39:40,910 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:40,922 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:40,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_915) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_916) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:40,935 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| Int) (v_ArrVal_915 (Array Int Int)) (v_ArrVal_916 (Array Int Int))) (or (= 0 (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27| v_ArrVal_915) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_916) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 1))) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_27|) 0)))) is different from false [2022-07-23 05:39:40,955 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:40,955 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 26 treesize of output 27 [2022-07-23 05:39:40,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:40,962 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 141 treesize of output 135 [2022-07-23 05:39:40,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 51 [2022-07-23 05:39:40,974 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 110 treesize of output 94 [2022-07-23 05:39:41,339 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-07-23 05:39:41,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [295812149] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:41,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:41,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 42 [2022-07-23 05:39:41,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544931416] [2022-07-23 05:39:41,339 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:41,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-23 05:39:41,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:41,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-23 05:39:41,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1024, Unknown=8, NotChecked=568, Total=1722 [2022-07-23 05:39:41,341 INFO L87 Difference]: Start difference. First operand 80 states and 89 transitions. Second operand has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:42,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:42,359 INFO L93 Difference]: Finished difference Result 126 states and 137 transitions. [2022-07-23 05:39:42,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-23 05:39:42,361 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 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-23 05:39:42,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:42,361 INFO L225 Difference]: With dead ends: 126 [2022-07-23 05:39:42,362 INFO L226 Difference]: Without dead ends: 126 [2022-07-23 05:39:42,362 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 419 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=246, Invalid=2129, Unknown=9, NotChecked=808, Total=3192 [2022-07-23 05:39:42,363 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 53 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 710 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:42,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 626 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 341 Invalid, 0 Unknown, 710 Unchecked, 0.2s Time] [2022-07-23 05:39:42,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-23 05:39:42,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 104. [2022-07-23 05:39:42,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 101 states have (on average 1.1386138613861385) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:42,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-07-23 05:39:42,366 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 34 [2022-07-23 05:39:42,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:42,366 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-07-23 05:39:42,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 1.6904761904761905) internal successors, (71), 42 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:42,366 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-07-23 05:39:42,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-23 05:39:42,367 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:42,367 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:42,385 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-23 05:39:42,571 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:42,572 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:42,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:42,572 INFO L85 PathProgramCache]: Analyzing trace with hash -412898380, now seen corresponding path program 2 times [2022-07-23 05:39:42,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:42,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159781633] [2022-07-23 05:39:42,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:42,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:42,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:42,968 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:42,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:42,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159781633] [2022-07-23 05:39:42,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159781633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:42,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1378590672] [2022-07-23 05:39:42,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:42,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:42,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:42,972 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-23 05:39:42,976 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-23 05:39:43,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:43,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:43,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-23 05:39:43,153 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:43,170 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:39:43,171 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:39:43,176 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-23 05:39:43,257 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:43,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-07-23 05:39:43,269 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:39:43,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:43,293 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 11 treesize of output 7 [2022-07-23 05:39:43,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:43,349 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 25 treesize of output 13 [2022-07-23 05:39:43,351 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:39:43,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:43,761 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:44,752 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:44,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1378590672] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:44,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:44,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 54 [2022-07-23 05:39:44,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880422913] [2022-07-23 05:39:44,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:44,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-23 05:39:44,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:44,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-23 05:39:44,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=248, Invalid=2722, Unknown=0, NotChecked=0, Total=2970 [2022-07-23 05:39:44,755 INFO L87 Difference]: Start difference. First operand 104 states and 115 transitions. Second operand has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:47,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:47,083 INFO L93 Difference]: Finished difference Result 129 states and 138 transitions. [2022-07-23 05:39:47,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 05:39:47,084 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 36 [2022-07-23 05:39:47,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:47,084 INFO L225 Difference]: With dead ends: 129 [2022-07-23 05:39:47,084 INFO L226 Difference]: Without dead ends: 58 [2022-07-23 05:39:47,086 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2210 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=837, Invalid=7719, Unknown=0, NotChecked=0, Total=8556 [2022-07-23 05:39:47,087 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 257 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 1120 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 1120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:47,087 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 605 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 1120 Invalid, 0 Unknown, 56 Unchecked, 0.7s Time] [2022-07-23 05:39:47,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-07-23 05:39:47,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 53. [2022-07-23 05:39:47,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.12) internal successors, (56), 52 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-23 05:39:47,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2022-07-23 05:39:47,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 36 [2022-07-23 05:39:47,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:47,089 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2022-07-23 05:39:47,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 55 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:47,090 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2022-07-23 05:39:47,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-23 05:39:47,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:47,090 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:47,110 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-23 05:39:47,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:47,300 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:47,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1201741191, now seen corresponding path program 3 times [2022-07-23 05:39:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:47,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247346938] [2022-07-23 05:39:47,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:47,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:47,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:47,493 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:47,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:47,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247346938] [2022-07-23 05:39:47,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247346938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:47,494 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580967777] [2022-07-23 05:39:47,494 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:39:47,494 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:47,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:47,495 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-23 05:39:47,499 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-23 05:39:47,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-23 05:39:47,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:47,676 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-23 05:39:47,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:47,689 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:47,689 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-23 05:39:47,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:47,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:39:47,777 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:47,778 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:39:47,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:47,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:48,099 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 27 treesize of output 23 [2022-07-23 05:39:48,256 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:48,256 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580967777] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:48,256 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:48,256 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-23 05:39:48,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598692692] [2022-07-23 05:39:48,256 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:48,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 05:39:48,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:48,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 05:39:48,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=955, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 05:39:48,258 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:48,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:48,745 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-23 05:39:48,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 05:39:48,746 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-23 05:39:48,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:48,746 INFO L225 Difference]: With dead ends: 54 [2022-07-23 05:39:48,746 INFO L226 Difference]: Without dead ends: 54 [2022-07-23 05:39:48,747 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1647, Unknown=0, NotChecked=0, Total=1892 [2022-07-23 05:39:48,747 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 280 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:48,748 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 226 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 325 Invalid, 0 Unknown, 82 Unchecked, 0.2s Time] [2022-07-23 05:39:48,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-23 05:39:48,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2022-07-23 05:39:48,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.1) internal successors, (55), 52 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-23 05:39:48,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-07-23 05:39:48,749 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 38 [2022-07-23 05:39:48,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:48,749 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-07-23 05:39:48,750 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 3.0) internal successors, (96), 33 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:48,750 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-07-23 05:39:48,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-23 05:39:48,750 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:48,750 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:48,778 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-23 05:39:48,963 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,SelfDestructingSolverStorable26 [2022-07-23 05:39:48,963 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:48,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:48,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1400728745, now seen corresponding path program 2 times [2022-07-23 05:39:48,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:48,964 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208019756] [2022-07-23 05:39:48,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:48,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:48,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:49,511 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:39:49,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208019756] [2022-07-23 05:39:49,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208019756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:49,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144709848] [2022-07-23 05:39:49,512 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:39:49,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:49,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:49,513 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-23 05:39:49,514 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-23 05:39:49,657 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:39:49,657 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:49,659 INFO L263 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 73 conjunts are in the unsatisfiable core [2022-07-23 05:39:49,663 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:49,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:49,681 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-23 05:39:49,688 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:39:49,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:39:49,751 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:49,751 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:39:49,757 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:39:49,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, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:49,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:49,862 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 25 treesize of output 13 [2022-07-23 05:39:49,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:39:50,340 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:39:50,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:51,146 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-23 05:39:51,146 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144709848] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:51,146 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:51,146 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15, 15] total 46 [2022-07-23 05:39:51,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709601980] [2022-07-23 05:39:51,147 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:51,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-07-23 05:39:51,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:51,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-07-23 05:39:51,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=1999, Unknown=0, NotChecked=0, Total=2162 [2022-07-23 05:39:51,149 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:52,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:52,001 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2022-07-23 05:39:52,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 05:39:52,002 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2022-07-23 05:39:52,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:52,002 INFO L225 Difference]: With dead ends: 59 [2022-07-23 05:39:52,002 INFO L226 Difference]: Without dead ends: 59 [2022-07-23 05:39:52,003 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 674 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=337, Invalid=3445, Unknown=0, NotChecked=0, Total=3782 [2022-07-23 05:39:52,003 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 24 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 74 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:52,004 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 266 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 264 Invalid, 0 Unknown, 74 Unchecked, 0.2s Time] [2022-07-23 05:39:52,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-23 05:39:52,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2022-07-23 05:39:52,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 57 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:52,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 60 transitions. [2022-07-23 05:39:52,005 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 60 transitions. Word has length 39 [2022-07-23 05:39:52,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:52,006 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 60 transitions. [2022-07-23 05:39:52,006 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 46 states have (on average 2.108695652173913) internal successors, (97), 47 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:39:52,006 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 60 transitions. [2022-07-23 05:39:52,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-07-23 05:39:52,007 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:52,007 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:52,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-23 05:39:52,211 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,SelfDestructingSolverStorable27 [2022-07-23 05:39:52,211 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:52,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1072669446, now seen corresponding path program 4 times [2022-07-23 05:39:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:52,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518469760] [2022-07-23 05:39:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:52,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:52,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518469760] [2022-07-23 05:39:52,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [518469760] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:52,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271761928] [2022-07-23 05:39:52,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:39:52,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:52,804 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:52,805 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-23 05:39:52,805 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-23 05:39:53,071 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:39:53,071 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:53,073 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 05:39:53,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:53,080 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-23 05:39:53,284 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-23 05:39:53,325 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:53,325 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:39:53,368 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:39:53,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:39:53,474 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:39:53,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:39:53,729 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:53,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:39:53,961 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:39:53,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:53,963 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-23 05:39:53,997 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:53,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:39:54,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:39:54,058 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:54,066 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1365 (Array Int Int)) (v_ArrVal_1364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1364) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1365) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:39:54,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:54,377 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 26 treesize of output 27 [2022-07-23 05:39:54,386 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:54,387 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 141 treesize of output 135 [2022-07-23 05:39:54,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 118 treesize of output 102 [2022-07-23 05:39:54,397 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 102 treesize of output 94 [2022-07-23 05:39:54,858 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:39:54,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 51 [2022-07-23 05:39:54,913 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-23 05:39:54,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271761928] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:39:54,914 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:39:54,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 62 [2022-07-23 05:39:54,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903824543] [2022-07-23 05:39:54,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:39:54,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-07-23 05:39:54,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:39:54,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-07-23 05:39:54,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=192, Invalid=3237, Unknown=5, NotChecked=348, Total=3782 [2022-07-23 05:39:54,917 INFO L87 Difference]: Start difference. First operand 58 states and 60 transitions. Second operand has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 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-23 05:39:55,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:39:55,241 INFO L93 Difference]: Finished difference Result 91 states and 93 transitions. [2022-07-23 05:39:55,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-23 05:39:55,242 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 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 44 [2022-07-23 05:39:55,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:39:55,242 INFO L225 Difference]: With dead ends: 91 [2022-07-23 05:39:55,242 INFO L226 Difference]: Without dead ends: 65 [2022-07-23 05:39:55,243 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 64 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=231, Invalid=3682, Unknown=5, NotChecked=372, Total=4290 [2022-07-23 05:39:55,244 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 278 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-23 05:39:55,244 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 791 Invalid, 541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 261 Invalid, 0 Unknown, 278 Unchecked, 0.1s Time] [2022-07-23 05:39:55,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-07-23 05:39:55,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-07-23 05:39:55,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 61 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-23 05:39:55,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2022-07-23 05:39:55,246 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 44 [2022-07-23 05:39:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:39:55,246 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2022-07-23 05:39:55,247 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 1.8709677419354838) internal successors, (116), 62 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-23 05:39:55,247 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2022-07-23 05:39:55,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-23 05:39:55,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:39:55,247 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:39:55,267 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-23 05:39:55,455 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,SelfDestructingSolverStorable28 [2022-07-23 05:39:55,455 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:39:55,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:39:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 682791063, now seen corresponding path program 5 times [2022-07-23 05:39:55,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:39:55,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374641193] [2022-07-23 05:39:55,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:39:55,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:39:55,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:39:55,687 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 1 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:55,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:39:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374641193] [2022-07-23 05:39:55,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374641193] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:39:55,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [888310368] [2022-07-23 05:39:55,687 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:39:55,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:39:55,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:39:55,689 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-23 05:39:55,689 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-23 05:39:56,176 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-07-23 05:39:56,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:39:56,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:39:56,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:39:56,200 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:56,201 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-23 05:39:56,210 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:39:56,210 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-23 05:39:56,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:39:56,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:39:56,345 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:39:56,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:39:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:39:56,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:02,725 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:40:08,809 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:40:14,859 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:40:20,932 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:40:21,000 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:21,001 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [888310368] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:21,001 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:21,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 12] total 34 [2022-07-23 05:40:21,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281770360] [2022-07-23 05:40:21,002 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:21,002 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-23 05:40:21,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:21,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-23 05:40:21,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=1053, Unknown=0, NotChecked=0, Total=1190 [2022-07-23 05:40:21,003 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 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-23 05:40:21,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:21,496 INFO L93 Difference]: Finished difference Result 63 states and 65 transitions. [2022-07-23 05:40:21,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-23 05:40:21,496 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 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) Word has length 48 [2022-07-23 05:40:21,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:21,497 INFO L225 Difference]: With dead ends: 63 [2022-07-23 05:40:21,497 INFO L226 Difference]: Without dead ends: 63 [2022-07-23 05:40:21,497 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 76 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 398 ImplicationChecksByTransitivity, 24.8s TimeCoverageRelationStatistics Valid=410, Invalid=1752, Unknown=0, NotChecked=0, Total=2162 [2022-07-23 05:40:21,498 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 278 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 10 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:21,498 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 224 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 401 Invalid, 0 Unknown, 10 Unchecked, 0.2s Time] [2022-07-23 05:40:21,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-23 05:40:21,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-07-23 05:40:21,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 59 states have (on average 1.0677966101694916) internal successors, (63), 61 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:21,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-07-23 05:40:21,500 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 48 [2022-07-23 05:40:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:21,501 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-07-23 05:40:21,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.735294117647059) internal successors, (127), 35 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-23 05:40:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-07-23 05:40:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 05:40:21,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:21,502 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:21,527 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-23 05:40:21,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:21,723 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:21,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:21,724 INFO L85 PathProgramCache]: Analyzing trace with hash 337884900, now seen corresponding path program 2 times [2022-07-23 05:40:21,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:21,724 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446676627] [2022-07-23 05:40:21,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:22,322 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:40:22,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:22,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446676627] [2022-07-23 05:40:22,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446676627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:22,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [716852603] [2022-07-23 05:40:22,323 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:40:22,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:22,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:22,324 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-23 05:40:22,325 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-23 05:40:22,532 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:40:22,532 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:22,535 INFO L263 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 95 conjunts are in the unsatisfiable core [2022-07-23 05:40:22,537 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:22,543 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:40:22,544 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-23 05:40:22,553 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:40:22,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:40:22,701 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:22,701 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 12 treesize of output 18 [2022-07-23 05:40:22,714 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:40:22,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:22,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:22,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:22,804 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 25 treesize of output 13 [2022-07-23 05:40:22,807 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:40:23,207 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:40:23,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:24,195 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 05:40:24,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [716852603] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:24,195 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:24,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 53 [2022-07-23 05:40:24,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055529520] [2022-07-23 05:40:24,195 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:24,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-07-23 05:40:24,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:24,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-07-23 05:40:24,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=2657, Unknown=0, NotChecked=0, Total=2862 [2022-07-23 05:40:24,197 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:27,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:27,123 INFO L93 Difference]: Finished difference Result 116 states and 117 transitions. [2022-07-23 05:40:27,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-07-23 05:40:27,123 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-23 05:40:27,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:27,124 INFO L225 Difference]: With dead ends: 116 [2022-07-23 05:40:27,124 INFO L226 Difference]: Without dead ends: 96 [2022-07-23 05:40:27,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2411 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=1006, Invalid=9500, Unknown=0, NotChecked=0, Total=10506 [2022-07-23 05:40:27,125 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 210 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 44 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:27,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 404 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 664 Invalid, 0 Unknown, 44 Unchecked, 0.4s Time] [2022-07-23 05:40:27,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-07-23 05:40:27,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 87. [2022-07-23 05:40:27,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 84 states have (on average 1.1428571428571428) internal successors, (96), 86 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:27,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2022-07-23 05:40:27,128 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 54 [2022-07-23 05:40:27,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:27,128 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2022-07-23 05:40:27,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 2.452830188679245) internal successors, (130), 54 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:27,129 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2022-07-23 05:40:27,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-23 05:40:27,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:27,129 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:27,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-23 05:40:27,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:27,335 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:27,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:27,336 INFO L85 PathProgramCache]: Analyzing trace with hash 358907032, now seen corresponding path program 6 times [2022-07-23 05:40:27,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:27,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121882184] [2022-07-23 05:40:27,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:27,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:27,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:27,912 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:27,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:27,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121882184] [2022-07-23 05:40:27,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121882184] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:27,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851995283] [2022-07-23 05:40:27,912 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:40:27,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:27,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:27,914 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-23 05:40:27,941 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-23 05:40:28,325 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-23 05:40:28,325 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:28,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 412 conjuncts, 96 conjunts are in the unsatisfiable core [2022-07-23 05:40:28,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:28,340 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:40:28,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:40:28,581 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-23 05:40:28,641 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:40:28,641 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:28,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:40:28,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:28,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 05:40:28,887 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-23 05:40:28,994 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:40:29,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:29,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:40:29,091 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-23 05:40:29,094 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:29,094 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:29,110 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:40:29,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:29,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1793 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1793) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:29,128 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:29,135 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1792 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_1792) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:29,139 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,143 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,149 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,152 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,157 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1794 (Array Int Int)) (v_ArrVal_1791 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_1791) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_1794) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:29,207 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:29,207 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 26 treesize of output 27 [2022-07-23 05:40:29,217 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:29,217 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 141 treesize of output 135 [2022-07-23 05:40:29,221 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2022-07-23 05:40:29,224 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 102 treesize of output 94 [2022-07-23 05:40:29,710 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 14 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 29 not checked. [2022-07-23 05:40:29,710 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851995283] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:29,710 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:29,710 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 23, 23] total 60 [2022-07-23 05:40:29,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867291277] [2022-07-23 05:40:29,711 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:29,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-07-23 05:40:29,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:29,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-07-23 05:40:29,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=2223, Unknown=11, NotChecked=1144, Total=3540 [2022-07-23 05:40:29,712 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 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-23 05:40:30,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:30,662 INFO L93 Difference]: Finished difference Result 126 states and 135 transitions. [2022-07-23 05:40:30,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 05:40:30,663 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 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) Word has length 54 [2022-07-23 05:40:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:30,664 INFO L225 Difference]: With dead ends: 126 [2022-07-23 05:40:30,664 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 05:40:30,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 76 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 11 IntricatePredicates, 0 DeprecatedPredicates, 629 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=258, Invalid=3807, Unknown=11, NotChecked=1474, Total=5550 [2022-07-23 05:40:30,665 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 36 mSDsluCounter, 869 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 895 SdHoareTripleChecker+Invalid, 1333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 698 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:30,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 895 Invalid, 1333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 623 Invalid, 0 Unknown, 698 Unchecked, 0.3s Time] [2022-07-23 05:40:30,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 05:40:30,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-23 05:40:30,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.1363636363636365) internal successors, (100), 90 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:30,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2022-07-23 05:40:30,668 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 54 [2022-07-23 05:40:30,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:30,669 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2022-07-23 05:40:30,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 60 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-23 05:40:30,669 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2022-07-23 05:40:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-07-23 05:40:30,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:30,670 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:30,688 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-23 05:40:30,870 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,SelfDestructingSolverStorable31 [2022-07-23 05:40:30,870 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:30,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:30,871 INFO L85 PathProgramCache]: Analyzing trace with hash 2070188021, now seen corresponding path program 7 times [2022-07-23 05:40:30,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:30,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391086671] [2022-07-23 05:40:30,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:30,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 6 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:31,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391086671] [2022-07-23 05:40:31,184 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391086671] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:31,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1979861844] [2022-07-23 05:40:31,184 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:40:31,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:31,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:31,186 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-23 05:40:31,214 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-23 05:40:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:31,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 434 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-23 05:40:31,400 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:31,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:40:31,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:40:31,566 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:40:31,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:40:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 15 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:31,703 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:32,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 23 [2022-07-23 05:40:32,258 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:40:32,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-07-23 05:40:32,261 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 10 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:32,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1979861844] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:32,261 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:32,261 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 44 [2022-07-23 05:40:32,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041922081] [2022-07-23 05:40:32,261 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:32,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-23 05:40:32,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:32,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-23 05:40:32,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1790, Unknown=0, NotChecked=0, Total=1980 [2022-07-23 05:40:32,262 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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-23 05:40:32,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:32,936 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2022-07-23 05:40:32,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 05:40:32,937 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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 58 [2022-07-23 05:40:32,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:32,937 INFO L225 Difference]: With dead ends: 92 [2022-07-23 05:40:32,937 INFO L226 Difference]: Without dead ends: 92 [2022-07-23 05:40:32,938 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 667 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=638, Invalid=2784, Unknown=0, NotChecked=0, Total=3422 [2022-07-23 05:40:32,938 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 497 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 631 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 497 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 631 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:32,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [497 Valid, 370 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 631 Invalid, 0 Unknown, 57 Unchecked, 0.3s Time] [2022-07-23 05:40:32,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-23 05:40:32,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-07-23 05:40:32,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 88 states have (on average 1.125) internal successors, (99), 90 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:32,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 99 transitions. [2022-07-23 05:40:32,941 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 99 transitions. Word has length 58 [2022-07-23 05:40:32,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:32,941 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 99 transitions. [2022-07-23 05:40:32,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 3.227272727272727) internal successors, (142), 45 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-23 05:40:32,941 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 99 transitions. [2022-07-23 05:40:32,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-07-23 05:40:32,942 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:32,942 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:32,963 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-23 05:40:33,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:33,147 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:33,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:33,148 INFO L85 PathProgramCache]: Analyzing trace with hash -248680787, now seen corresponding path program 3 times [2022-07-23 05:40:33,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:33,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160068150] [2022-07-23 05:40:33,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:33,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:33,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:33,605 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-23 05:40:33,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:33,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160068150] [2022-07-23 05:40:33,606 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160068150] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:33,606 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1249581696] [2022-07-23 05:40:33,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:40:33,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:33,606 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:33,612 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-23 05:40:33,627 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-23 05:40:34,229 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-23 05:40:34,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:34,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-23 05:40:34,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:34,250 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:34,250 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-23 05:40:34,261 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:40:34,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:40:34,402 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:40:34,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:34,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:40:34,433 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 11 treesize of output 7 [2022-07-23 05:40:34,436 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:34,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-07-23 05:40:34,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, 2 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-23 05:40:34,977 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-23 05:40:34,977 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-23 05:40:36,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1249581696] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:36,025 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:36,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 56 [2022-07-23 05:40:36,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299604455] [2022-07-23 05:40:36,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:36,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-07-23 05:40:36,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:36,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-07-23 05:40:36,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=2941, Unknown=0, NotChecked=0, Total=3192 [2022-07-23 05:40:36,027 INFO L87 Difference]: Start difference. First operand 91 states and 99 transitions. Second operand has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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-23 05:40:38,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:38,265 INFO L93 Difference]: Finished difference Result 90 states and 94 transitions. [2022-07-23 05:40:38,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-23 05:40:38,265 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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) Word has length 59 [2022-07-23 05:40:38,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:38,266 INFO L225 Difference]: With dead ends: 90 [2022-07-23 05:40:38,266 INFO L226 Difference]: Without dead ends: 90 [2022-07-23 05:40:38,267 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1848 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=910, Invalid=6746, Unknown=0, NotChecked=0, Total=7656 [2022-07-23 05:40:38,267 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 168 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1033 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:38,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 337 Invalid, 1033 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 905 Invalid, 0 Unknown, 3 Unchecked, 0.5s Time] [2022-07-23 05:40:38,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-23 05:40:38,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2022-07-23 05:40:38,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 88 states have (on average 1.0681818181818181) internal successors, (94), 89 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-23 05:40:38,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-07-23 05:40:38,270 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 59 [2022-07-23 05:40:38,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:38,270 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-07-23 05:40:38,270 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 2.375) internal successors, (133), 57 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-23 05:40:38,270 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-07-23 05:40:38,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2022-07-23 05:40:38,271 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:38,271 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:38,292 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-23 05:40:38,479 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:38,479 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:38,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:38,480 INFO L85 PathProgramCache]: Analyzing trace with hash -1595605642, now seen corresponding path program 8 times [2022-07-23 05:40:38,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:38,480 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580005587] [2022-07-23 05:40:38,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:38,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:38,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:39,121 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:39,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:39,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580005587] [2022-07-23 05:40:39,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580005587] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:39,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176863986] [2022-07-23 05:40:39,122 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:40:39,122 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:39,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:39,124 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-23 05:40:39,124 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-23 05:40:39,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:40:39,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:39,312 INFO L263 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 109 conjunts are in the unsatisfiable core [2022-07-23 05:40:39,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:39,330 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:40:39,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:40:39,573 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-23 05:40:39,629 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:40:39,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:40:39,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:39,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:40:39,794 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:40:39,895 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:40:40,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:40:40,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:40,128 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:40,148 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:40:40,168 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-23 05:40:40,172 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:40,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:40,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:40:40,189 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:40,197 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2267 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2267) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:40,202 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:40,211 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2266 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2266) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:40,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:40,224 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2265 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2265) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:40,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,235 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,240 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,244 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2268 (Array Int Int)) (v_ArrVal_2264 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2264) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2268) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:40,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:40,309 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 26 treesize of output 27 [2022-07-23 05:40:40,314 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:40,314 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 71 treesize of output 71 [2022-07-23 05:40:40,318 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 54 treesize of output 46 [2022-07-23 05:40:40,321 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 24 treesize of output 20 [2022-07-23 05:40:40,854 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 18 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 51 not checked. [2022-07-23 05:40:40,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176863986] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:40,855 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:40,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 26, 26] total 69 [2022-07-23 05:40:40,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297740456] [2022-07-23 05:40:40,855 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:40,855 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-23 05:40:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-23 05:40:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-23 05:40:40,856 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 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-23 05:40:41,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:41,686 INFO L93 Difference]: Finished difference Result 135 states and 139 transitions. [2022-07-23 05:40:41,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:40:41,687 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 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) Word has length 64 [2022-07-23 05:40:41,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:41,687 INFO L225 Difference]: With dead ends: 135 [2022-07-23 05:40:41,687 INFO L226 Difference]: Without dead ends: 97 [2022-07-23 05:40:41,688 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 89 SyntacticMatches, 12 SemanticMatches, 77 ConstructedPredicates, 13 IntricatePredicates, 1 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=280, Invalid=4049, Unknown=13, NotChecked=1820, Total=6162 [2022-07-23 05:40:41,688 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 924 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 1494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1004 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:41,689 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 953 Invalid, 1494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 478 Invalid, 0 Unknown, 1004 Unchecked, 0.2s Time] [2022-07-23 05:40:41,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-23 05:40:41,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2022-07-23 05:40:41,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.065217391304348) internal successors, (98), 93 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:41,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-07-23 05:40:41,691 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 64 [2022-07-23 05:40:41,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:41,691 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-07-23 05:40:41,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.2028985507246377) internal successors, (152), 69 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-23 05:40:41,692 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-07-23 05:40:41,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-23 05:40:41,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:41,692 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:41,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-07-23 05:40:41,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-07-23 05:40:41,908 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:41,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:41,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1757527917, now seen corresponding path program 9 times [2022-07-23 05:40:41,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:41,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197580962] [2022-07-23 05:40:41,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:41,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:42,264 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 15 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:42,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:42,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197580962] [2022-07-23 05:40:42,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197580962] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:42,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286377554] [2022-07-23 05:40:42,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:40:42,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:42,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:42,266 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-23 05:40:42,268 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-23 05:40:42,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-23 05:40:42,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:42,932 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-23 05:40:42,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:42,944 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:42,944 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-23 05:40:43,113 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:40:43,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:40:43,122 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:40:43,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:40:43,355 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:43,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:43,732 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 29 treesize of output 25 [2022-07-23 05:40:44,036 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 28 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:44,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286377554] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:44,037 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:44,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 18] total 54 [2022-07-23 05:40:44,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014713287] [2022-07-23 05:40:44,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:44,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-23 05:40:44,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:44,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-23 05:40:44,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=2664, Unknown=0, NotChecked=0, Total=2970 [2022-07-23 05:40:44,039 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:44,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:44,763 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-07-23 05:40:44,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 05:40:44,763 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 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 68 [2022-07-23 05:40:44,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:44,764 INFO L225 Difference]: With dead ends: 94 [2022-07-23 05:40:44,764 INFO L226 Difference]: Without dead ends: 94 [2022-07-23 05:40:44,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1204 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=686, Invalid=4284, Unknown=0, NotChecked=0, Total=4970 [2022-07-23 05:40:44,765 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 380 mSDsluCounter, 276 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 75 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:44,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 307 Invalid, 598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 460 Invalid, 0 Unknown, 75 Unchecked, 0.2s Time] [2022-07-23 05:40:44,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-23 05:40:44,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-07-23 05:40:44,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 92 states have (on average 1.0543478260869565) internal successors, (97), 93 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:44,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 97 transitions. [2022-07-23 05:40:44,767 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 97 transitions. Word has length 68 [2022-07-23 05:40:44,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:44,767 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 97 transitions. [2022-07-23 05:40:44,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 3.6296296296296298) internal successors, (196), 55 states have internal predecessors, (196), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:44,767 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-07-23 05:40:44,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-23 05:40:44,768 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:44,768 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:44,791 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-23 05:40:44,979 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:44,979 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:44,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:44,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1529659500, now seen corresponding path program 10 times [2022-07-23 05:40:44,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:44,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241466923] [2022-07-23 05:40:44,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:44,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:45,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241466923] [2022-07-23 05:40:45,874 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241466923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:45,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542834398] [2022-07-23 05:40:45,874 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:40:45,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:45,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:45,876 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-23 05:40:45,876 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-23 05:40:46,647 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:40:46,648 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:46,652 INFO L263 TraceCheckSpWp]: Trace formula consists of 544 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-23 05:40:46,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:46,665 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:40:46,665 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:40:47,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-23 05:40:47,082 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:40:47,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:47,140 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:40:47,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:40:47,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 05:40:47,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-23 05:40:47,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:40:47,587 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:47,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:47,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:40:47,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:40:47,729 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-23 05:40:47,732 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:47,732 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:40:47,741 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|))) is different from false [2022-07-23 05:40:47,746 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:47,753 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2636 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2636) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:40:47,757 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:47,765 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2635 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2635) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:40:47,770 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:47,785 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2634 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2634) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:40:47,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:47,797 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2633 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_2633) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:40:47,802 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:47,812 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:40:47,819 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:40:47,824 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:40:47,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-23 05:40:47,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_2632) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_2637) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 5 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-23 05:40:47,838 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2637 (Array Int Int)) (v_ArrVal_2632 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| Int)) (or (= (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39| v_ArrVal_2632) |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2637) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (not (= (select |c_#valid| |v_ULTIMATE.start_cstpncpy_~#dst#1.base_39|) 0)))) is different from false [2022-07-23 05:40:47,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:47,843 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 26 treesize of output 27 [2022-07-23 05:40:47,848 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:40:47,848 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 141 treesize of output 135 [2022-07-23 05:40:47,855 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 118 treesize of output 102 [2022-07-23 05:40:47,858 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 102 treesize of output 94 [2022-07-23 05:40:48,544 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 79 not checked. [2022-07-23 05:40:48,545 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542834398] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:40:48,545 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:40:48,545 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 29, 29] total 78 [2022-07-23 05:40:48,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438787709] [2022-07-23 05:40:48,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:40:48,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-07-23 05:40:48,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:40:48,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-07-23 05:40:48,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=3620, Unknown=16, NotChecked=2160, Total=6006 [2022-07-23 05:40:48,551 INFO L87 Difference]: Start difference. First operand 94 states and 97 transitions. Second operand has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:50,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:40:50,100 INFO L93 Difference]: Finished difference Result 145 states and 148 transitions. [2022-07-23 05:40:50,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-23 05:40:50,101 INFO L78 Accepts]: Start accepts. Automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-23 05:40:50,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:40:50,101 INFO L225 Difference]: With dead ends: 145 [2022-07-23 05:40:50,101 INFO L226 Difference]: Without dead ends: 101 [2022-07-23 05:40:50,102 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 95 ConstructedPredicates, 16 IntricatePredicates, 1 DeprecatedPredicates, 1146 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=352, Invalid=6171, Unknown=21, NotChecked=2768, Total=9312 [2022-07-23 05:40:50,102 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 26 mSDsluCounter, 1358 mSDsCounter, 0 mSdLazyCounter, 824 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 1391 SdHoareTripleChecker+Invalid, 2060 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 824 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1218 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:40:50,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 1391 Invalid, 2060 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 824 Invalid, 0 Unknown, 1218 Unchecked, 0.4s Time] [2022-07-23 05:40:50,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-23 05:40:50,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2022-07-23 05:40:50,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0520833333333333) internal successors, (101), 97 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 101 transitions. [2022-07-23 05:40:50,104 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 101 transitions. Word has length 74 [2022-07-23 05:40:50,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:40:50,104 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 101 transitions. [2022-07-23 05:40:50,104 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 2.2948717948717947) internal successors, (179), 78 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:40:50,104 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 101 transitions. [2022-07-23 05:40:50,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-23 05:40:50,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:40:50,105 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:40:50,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-07-23 05:40:50,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:50,307 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:40:50,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:40:50,308 INFO L85 PathProgramCache]: Analyzing trace with hash -123927951, now seen corresponding path program 11 times [2022-07-23 05:40:50,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:40:50,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779537991] [2022-07-23 05:40:50,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:40:50,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:40:50,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:40:50,656 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 28 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:50,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:40:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779537991] [2022-07-23 05:40:50,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779537991] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:40:50,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1491905729] [2022-07-23 05:40:50,657 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:40:50,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:40:50,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:40:50,659 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-23 05:40:50,660 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-23 05:40:58,898 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-07-23 05:40:58,898 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:40:58,913 INFO L263 TraceCheckSpWp]: Trace formula consists of 566 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 05:40:58,915 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:40:58,927 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:58,927 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-23 05:40:58,937 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:40:58,937 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-23 05:40:59,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:40:59,215 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:40:59,220 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:40:59,220 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:40:59,477 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 45 proven. 123 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:40:59,478 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:05,902 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:41:12,000 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 31 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:41:18,062 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:41:24,147 WARN L233 SmtUtils]: Spent 6.01s on a formula simplification that was a NOOP. DAG size: 30 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-23 05:41:34,782 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 66 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:34,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1491905729] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:34,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:34,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 18] total 52 [2022-07-23 05:41:34,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837872790] [2022-07-23 05:41:34,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:34,783 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-07-23 05:41:34,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:34,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-07-23 05:41:34,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2468, Unknown=0, NotChecked=0, Total=2756 [2022-07-23 05:41:34,784 INFO L87 Difference]: Start difference. First operand 98 states and 101 transitions. Second operand has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:35,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:35,725 INFO L93 Difference]: Finished difference Result 98 states and 100 transitions. [2022-07-23 05:41:35,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-23 05:41:35,726 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-23 05:41:35,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:35,726 INFO L225 Difference]: With dead ends: 98 [2022-07-23 05:41:35,727 INFO L226 Difference]: Without dead ends: 98 [2022-07-23 05:41:35,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 128 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1303 ImplicationChecksByTransitivity, 36.0s TimeCoverageRelationStatistics Valid=606, Invalid=5094, Unknown=0, NotChecked=0, Total=5700 [2022-07-23 05:41:35,728 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 154 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:35,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 529 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 852 Invalid, 0 Unknown, 51 Unchecked, 0.4s Time] [2022-07-23 05:41:35,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-07-23 05:41:35,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-07-23 05:41:35,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0416666666666667) internal successors, (100), 97 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:35,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2022-07-23 05:41:35,730 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 78 [2022-07-23 05:41:35,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:35,730 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2022-07-23 05:41:35,730 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 4.1923076923076925) internal successors, (218), 53 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:35,731 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2022-07-23 05:41:35,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-23 05:41:35,731 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:35,731 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:35,766 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-23 05:41:35,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:35,949 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:41:35,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:35,950 INFO L85 PathProgramCache]: Analyzing trace with hash 2047124210, now seen corresponding path program 12 times [2022-07-23 05:41:35,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:35,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134569147] [2022-07-23 05:41:35,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:35,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:36,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:36,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134569147] [2022-07-23 05:41:36,930 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134569147] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:36,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [751619945] [2022-07-23 05:41:36,931 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-23 05:41:36,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:36,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:36,932 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-23 05:41:36,932 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-23 05:41:42,075 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-07-23 05:41:42,075 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:42,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 610 conjuncts, 185 conjunts are in the unsatisfiable core [2022-07-23 05:41:42,092 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:42,105 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:41:42,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:41:42,611 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-23 05:41:42,679 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:41:42,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:41:42,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:41:42,737 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 11 treesize of output 7 [2022-07-23 05:41:42,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:41:42,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:41:42,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:41:43,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:41:43,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:43,357 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:43,517 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:43,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:43,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:43,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:44,127 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:41:44,129 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:44,129 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-23 05:41:44,132 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:44,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:44,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:41:44,147 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:41:44,161 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3058 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3058) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:41:44,167 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:41:44,176 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3057 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3057) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)))) is different from false [2022-07-23 05:41:44,184 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:41:44,194 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3056 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3056) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:41:44,205 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:41:44,230 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3055 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3055) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:41:44,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:41:44,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3054 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3054) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:41:44,252 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3059 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:44,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:44,264 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)))) is different from false [2022-07-23 05:41:44,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~src#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:44,275 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:44,280 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3053 (Array Int Int)) (v_ArrVal_3059 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3053) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3059) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:44,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:44,359 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 26 treesize of output 27 [2022-07-23 05:41:44,366 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:44,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 71 [2022-07-23 05:41:44,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 46 [2022-07-23 05:41:44,375 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 24 treesize of output 20 [2022-07-23 05:41:45,249 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 26 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 113 not checked. [2022-07-23 05:41:45,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [751619945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:45,250 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:45,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 32, 32] total 95 [2022-07-23 05:41:45,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428862566] [2022-07-23 05:41:45,250 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:45,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 95 states [2022-07-23 05:41:45,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:45,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2022-07-23 05:41:45,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=286, Invalid=5771, Unknown=17, NotChecked=2856, Total=8930 [2022-07-23 05:41:45,251 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:46,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:46,670 INFO L93 Difference]: Finished difference Result 152 states and 154 transitions. [2022-07-23 05:41:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-23 05:41:46,671 INFO L78 Accepts]: Start accepts. Automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 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 84 [2022-07-23 05:41:46,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:46,672 INFO L225 Difference]: With dead ends: 152 [2022-07-23 05:41:46,672 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 05:41:46,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 117 SyntacticMatches, 4 SemanticMatches, 113 ConstructedPredicates, 17 IntricatePredicates, 9 DeprecatedPredicates, 2624 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=430, Invalid=9127, Unknown=17, NotChecked=3536, Total=13110 [2022-07-23 05:41:46,673 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 32 mSDsluCounter, 1521 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 1558 SdHoareTripleChecker+Invalid, 2373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1635 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:46,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 1558 Invalid, 2373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 732 Invalid, 0 Unknown, 1635 Unchecked, 0.3s Time] [2022-07-23 05:41:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 05:41:46,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 05:41:46,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.04) internal successors, (104), 101 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:46,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2022-07-23 05:41:46,675 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 84 [2022-07-23 05:41:46,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:46,675 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2022-07-23 05:41:46,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 95 states, 95 states have (on average 2.389473684210526) internal successors, (227), 95 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:46,675 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2022-07-23 05:41:46,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-07-23 05:41:46,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:46,676 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:46,699 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-07-23 05:41:46,879 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,SelfDestructingSolverStorable38 [2022-07-23 05:41:46,879 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:41:46,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:46,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1064449423, now seen corresponding path program 13 times [2022-07-23 05:41:46,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:46,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945436601] [2022-07-23 05:41:46,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:46,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:46,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 45 proven. 186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:47,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:47,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945436601] [2022-07-23 05:41:47,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945436601] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:47,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212609610] [2022-07-23 05:41:47,347 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-23 05:41:47,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:47,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:47,348 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-23 05:41:47,350 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-23 05:41:47,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:47,645 INFO L263 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 86 conjunts are in the unsatisfiable core [2022-07-23 05:41:47,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:47,935 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:41:47,935 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:41:47,940 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:41:47,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:41:48,145 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 66 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:48,146 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:48,643 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 27 treesize of output 23 [2022-07-23 05:41:49,104 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-23 05:41:49,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 13 treesize of output 12 [2022-07-23 05:41:49,107 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 55 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:49,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212609610] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:49,107 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:49,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23, 23] total 58 [2022-07-23 05:41:49,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321809969] [2022-07-23 05:41:49,107 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:49,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-07-23 05:41:49,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:49,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-07-23 05:41:49,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=3140, Unknown=0, NotChecked=0, Total=3422 [2022-07-23 05:41:49,108 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:50,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:50,472 INFO L93 Difference]: Finished difference Result 102 states and 103 transitions. [2022-07-23 05:41:50,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-23 05:41:50,473 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 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 88 [2022-07-23 05:41:50,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:50,473 INFO L225 Difference]: With dead ends: 102 [2022-07-23 05:41:50,473 INFO L226 Difference]: Without dead ends: 102 [2022-07-23 05:41:50,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 156 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1322 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1074, Invalid=6236, Unknown=0, NotChecked=0, Total=7310 [2022-07-23 05:41:50,474 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 749 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 749 SdHoareTripleChecker+Valid, 720 SdHoareTripleChecker+Invalid, 1227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:50,474 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [749 Valid, 720 Invalid, 1227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 1013 Invalid, 0 Unknown, 99 Unchecked, 0.5s Time] [2022-07-23 05:41:50,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-23 05:41:50,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-07-23 05:41:50,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 100 states have (on average 1.03) internal successors, (103), 101 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:50,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2022-07-23 05:41:50,475 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 88 [2022-07-23 05:41:50,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:50,476 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2022-07-23 05:41:50,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 58 states have (on average 3.689655172413793) internal successors, (214), 59 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:50,476 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2022-07-23 05:41:50,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-23 05:41:50,477 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:50,477 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:50,495 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-23 05:41:50,683 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,SelfDestructingSolverStorable39 [2022-07-23 05:41:50,683 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:41:50,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:50,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1646098544, now seen corresponding path program 14 times [2022-07-23 05:41:50,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:50,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697051396] [2022-07-23 05:41:50,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:50,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:50,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:51,774 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:51,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:51,774 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697051396] [2022-07-23 05:41:51,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697051396] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:51,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068454685] [2022-07-23 05:41:51,775 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-23 05:41:51,775 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:51,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:51,776 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-23 05:41:51,777 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-23 05:41:52,063 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-23 05:41:52,063 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:41:52,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 676 conjuncts, 156 conjunts are in the unsatisfiable core [2022-07-23 05:41:52,071 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:41:52,084 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:41:52,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:41:52,608 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-23 05:41:52,684 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-23 05:41:52,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:52,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:41:52,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:41:52,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-07-23 05:41:53,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 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-23 05:41:53,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:41:53,276 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:53,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:53,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:53,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-23 05:41:53,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-23 05:41:53,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-23 05:41:53,579 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-23 05:41:53,582 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:53,583 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:41:53,593 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:41:53,598 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:41:53,605 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3524 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3524) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:41:53,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:41:53,618 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3523 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3523) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:41:53,623 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:41:53,631 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3522 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3522) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:41:53,642 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:41:53,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3521 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3521) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:41:53,658 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-23 05:41:53,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3520 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3520) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:41:53,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:53,690 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3519 (Array Int Int)) (v_ArrVal_3525 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_3519) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:41:53,696 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-23 05:41:53,703 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-23 05:41:53,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)))) is different from false [2022-07-23 05:41:53,715 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_~src#1.offset|)) 0)) is different from false [2022-07-23 05:41:53,722 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-23 05:41:53,727 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3525 (Array Int Int)) (v_ArrVal_3518 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_3518) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_3525) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ 7 |c_ULTIMATE.start_cstpncpy_#in~src#1.offset|)) 0)) is different from false [2022-07-23 05:41:53,813 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:53,813 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 26 treesize of output 27 [2022-07-23 05:41:53,819 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:41:53,820 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 71 treesize of output 71 [2022-07-23 05:41:53,824 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 28 treesize of output 24 [2022-07-23 05:41:53,830 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 50 treesize of output 42 [2022-07-23 05:41:54,901 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 30 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 153 not checked. [2022-07-23 05:41:54,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068454685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:41:54,901 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:41:54,902 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 35, 35] total 96 [2022-07-23 05:41:54,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222947420] [2022-07-23 05:41:54,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:41:54,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-23 05:41:54,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:41:54,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-23 05:41:54,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=262, Invalid=5647, Unknown=19, NotChecked=3192, Total=9120 [2022-07-23 05:41:54,903 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:41:57,194 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2022-07-23 05:41:57,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 05:41:57,194 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-23 05:41:57,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:41:57,195 INFO L225 Difference]: With dead ends: 165 [2022-07-23 05:41:57,195 INFO L226 Difference]: Without dead ends: 109 [2022-07-23 05:41:57,196 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 135 SyntacticMatches, 15 SemanticMatches, 117 ConstructedPredicates, 19 IntricatePredicates, 1 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=413, Invalid=9544, Unknown=19, NotChecked=4066, Total=14042 [2022-07-23 05:41:57,197 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 36 mSDsluCounter, 2050 mSDsCounter, 0 mSdLazyCounter, 1509 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 2091 SdHoareTripleChecker+Invalid, 3404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1877 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 05:41:57,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 2091 Invalid, 3404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1509 Invalid, 0 Unknown, 1877 Unchecked, 0.6s Time] [2022-07-23 05:41:57,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-07-23 05:41:57,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2022-07-23 05:41:57,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 104 states have (on average 1.0288461538461537) internal successors, (107), 105 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 107 transitions. [2022-07-23 05:41:57,199 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 107 transitions. Word has length 94 [2022-07-23 05:41:57,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:41:57,200 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 107 transitions. [2022-07-23 05:41:57,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.4270833333333335) internal successors, (233), 96 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:41:57,200 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 107 transitions. [2022-07-23 05:41:57,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-23 05:41:57,201 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:41:57,201 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:41:57,230 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-23 05:41:57,427 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:57,428 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:41:57,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:41:57,428 INFO L85 PathProgramCache]: Analyzing trace with hash -45925907, now seen corresponding path program 15 times [2022-07-23 05:41:57,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:41:57,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666759992] [2022-07-23 05:41:57,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:41:57,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:41:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:41:57,959 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 66 proven. 238 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:41:57,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:41:57,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666759992] [2022-07-23 05:41:57,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666759992] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:41:57,960 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922844032] [2022-07-23 05:41:57,960 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:41:57,960 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:41:57,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:41:57,969 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-23 05:41:57,971 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-23 05:42:05,690 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-23 05:42:05,690 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:05,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-23 05:42:05,708 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:05,724 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:05,725 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-23 05:42:05,738 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:42:05,739 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-23 05:42:06,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:42:06,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:42:06,163 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:42:06,164 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:42:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 91 proven. 213 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:06,659 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 120 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:07,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922844032] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:07,882 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:07,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 23] total 69 [2022-07-23 05:42:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099314184] [2022-07-23 05:42:07,882 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:07,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 70 states [2022-07-23 05:42:07,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:07,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2022-07-23 05:42:07,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=4329, Unknown=0, NotChecked=0, Total=4830 [2022-07-23 05:42:07,884 INFO L87 Difference]: Start difference. First operand 106 states and 107 transitions. Second operand has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:09,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:09,801 INFO L93 Difference]: Finished difference Result 112 states and 114 transitions. [2022-07-23 05:42:09,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-23 05:42:09,801 INFO L78 Accepts]: Start accepts. Automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-23 05:42:09,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:09,802 INFO L225 Difference]: With dead ends: 112 [2022-07-23 05:42:09,802 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 05:42:09,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1751 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1882, Invalid=8018, Unknown=0, NotChecked=0, Total=9900 [2022-07-23 05:42:09,803 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 731 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 731 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 123 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:09,803 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [731 Valid, 519 Invalid, 938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [123 Valid, 782 Invalid, 0 Unknown, 33 Unchecked, 0.4s Time] [2022-07-23 05:42:09,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 05:42:09,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2022-07-23 05:42:09,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 108 states have (on average 1.0277777777777777) internal successors, (111), 109 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 111 transitions. [2022-07-23 05:42:09,806 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 111 transitions. Word has length 98 [2022-07-23 05:42:09,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:09,806 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 111 transitions. [2022-07-23 05:42:09,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 70 states, 69 states have (on average 4.144927536231884) internal successors, (286), 70 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:09,806 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 111 transitions. [2022-07-23 05:42:09,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-23 05:42:09,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:09,807 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:09,817 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-23 05:42:10,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:10,008 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:42:10,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -14055494, now seen corresponding path program 3 times [2022-07-23 05:42:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:10,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59169939] [2022-07-23 05:42:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:10,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:10,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:11,118 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 103 proven. 97 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2022-07-23 05:42:11,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59169939] [2022-07-23 05:42:11,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59169939] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:11,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539380516] [2022-07-23 05:42:11,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-23 05:42:11,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:11,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:11,120 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-23 05:42:11,121 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-23 05:42:20,038 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2022-07-23 05:42:20,038 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:20,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 751 conjuncts, 236 conjunts are in the unsatisfiable core [2022-07-23 05:42:20,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:20,075 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:42:20,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:42:20,082 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-23 05:42:20,910 INFO L356 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2022-07-23 05:42:20,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 33 [2022-07-23 05:42:20,930 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:42:20,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:42:20,990 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 11 treesize of output 7 [2022-07-23 05:42:20,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:42:21,128 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 33 treesize of output 17 [2022-07-23 05:42:21,130 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-23 05:42:24,233 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:24,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:33,875 INFO L134 CoverageAnalysis]: Checked inductivity of 320 backedges. 0 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:33,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539380516] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:33,876 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:33,876 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 40, 40] total 110 [2022-07-23 05:42:33,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746474445] [2022-07-23 05:42:33,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:33,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 111 states [2022-07-23 05:42:33,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:33,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2022-07-23 05:42:33,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1005, Invalid=11205, Unknown=0, NotChecked=0, Total=12210 [2022-07-23 05:42:33,878 INFO L87 Difference]: Start difference. First operand 110 states and 111 transitions. Second operand has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:42:49,874 INFO L93 Difference]: Finished difference Result 183 states and 185 transitions. [2022-07-23 05:42:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2022-07-23 05:42:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 104 [2022-07-23 05:42:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:42:49,875 INFO L225 Difference]: With dead ends: 183 [2022-07-23 05:42:49,875 INFO L226 Difference]: Without dead ends: 175 [2022-07-23 05:42:49,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 195 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10698 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=3115, Invalid=35497, Unknown=0, NotChecked=0, Total=38612 [2022-07-23 05:42:49,878 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 345 mSDsluCounter, 1152 mSDsCounter, 0 mSdLazyCounter, 1539 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 977 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 05:42:49,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1181 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1539 Invalid, 0 Unknown, 977 Unchecked, 1.9s Time] [2022-07-23 05:42:49,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-23 05:42:49,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 105. [2022-07-23 05:42:49,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 104 states have (on average 1.0192307692307692) internal successors, (106), 104 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-07-23 05:42:49,880 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 104 [2022-07-23 05:42:49,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:42:49,881 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-07-23 05:42:49,881 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 111 states, 110 states have (on average 2.5090909090909093) internal successors, (276), 111 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:42:49,881 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-07-23 05:42:49,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-07-23 05:42:49,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:42:49,882 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:42:49,894 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-23 05:42:50,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:50,087 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:42:50,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:42:50,088 INFO L85 PathProgramCache]: Analyzing trace with hash 6966638, now seen corresponding path program 16 times [2022-07-23 05:42:50,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:42:50,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728223461] [2022-07-23 05:42:50,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:42:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:42:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:42:51,431 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:51,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:42:51,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728223461] [2022-07-23 05:42:51,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728223461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:42:51,431 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [825523224] [2022-07-23 05:42:51,431 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-23 05:42:51,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:42:51,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:42:51,432 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-23 05:42:51,433 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-23 05:42:52,711 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-23 05:42:52,712 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:42:52,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 204 conjunts are in the unsatisfiable core [2022-07-23 05:42:52,723 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:42:52,735 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-23 05:42:52,736 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 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 19 treesize of output 18 [2022-07-23 05:42:53,424 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-23 05:42:53,510 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:42:53,510 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-23 05:42:53,586 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-23 05:42:53,590 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-23 05:42:53,600 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 11 treesize of output 7 [2022-07-23 05:42:53,771 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-23 05:42:53,773 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-23 05:42:53,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, 2 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-23 05:42:54,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:42:54,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:42:54,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:42:54,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:42:55,203 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:42:55,428 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:42:55,650 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-23 05:42:55,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-23 05:42:56,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-23 05:42:56,073 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:56,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 10 [2022-07-23 05:42:56,077 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:42:56,077 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:42:56,086 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|) 0)) is different from false [2022-07-23 05:42:56,091 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:56,099 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4321 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4321) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-23 05:42:56,104 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:42:56,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4320 (Array Int Int)) (v_ArrVal_4322 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4320) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 2)) 0)) is different from false [2022-07-23 05:42:56,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:42:56,124 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4319 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4319) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 3)) 0)) is different from false [2022-07-23 05:42:56,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)))) is different from false [2022-07-23 05:42:56,137 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4318 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4318) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-23 05:42:56,142 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)))) is different from false [2022-07-23 05:42:56,150 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4317 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4317) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 5)) 0)) is different from false [2022-07-23 05:42:56,155 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:42:56,163 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4316 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4316) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 6)) 0)) is different from false [2022-07-23 05:42:56,169 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-23 05:42:56,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4315 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_#t~post5#1.base| v_ArrVal_4315) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstpncpy_~s~0#1.offset| 7)) 0)) is different from false [2022-07-23 05:42:56,257 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,269 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (not (<= |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| |c_ULTIMATE.start_cstpncpy_~s~0#1.offset|)) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_~d~0#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,283 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#t~mem2#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,291 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,305 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_cstpncpy_~#dst#1.base|) |c_ULTIMATE.start_cstpncpy_~#dst#1.offset|) v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_4322 (Array Int Int)) (v_ArrVal_4314 (Array Int Int)) (|v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| Int)) (or (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstpncpy_~#dst#1.base| v_ArrVal_4314) |c_ULTIMATE.start_cstpncpy_#in~dst#1.base| v_ArrVal_4322) |c_ULTIMATE.start_cstpncpy_#in~src#1.base|) (+ |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256| 8)) 0) (< |c_ULTIMATE.start_cstpncpy_#in~src#1.offset| |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|) (not (<= 0 |v_ULTIMATE.start_cstpncpy_#t~post6#1.offset_256|)))) is different from false [2022-07-23 05:42:56,408 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:56,409 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 26 treesize of output 27 [2022-07-23 05:42:56,414 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-23 05:42:56,415 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 71 treesize of output 71 [2022-07-23 05:42:56,419 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 28 treesize of output 24 [2022-07-23 05:42:56,427 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 50 treesize of output 42 [2022-07-23 05:42:58,092 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 34 proven. 122 refuted. 0 times theorem prover too weak. 0 trivial. 198 not checked. [2022-07-23 05:42:58,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [825523224] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 05:42:58,093 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 05:42:58,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 39, 39] total 117 [2022-07-23 05:42:58,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093946740] [2022-07-23 05:42:58,094 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 05:42:58,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 117 states [2022-07-23 05:42:58,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 05:42:58,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2022-07-23 05:42:58,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=332, Invalid=8851, Unknown=21, NotChecked=4368, Total=13572 [2022-07-23 05:42:58,102 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:01,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 05:43:01,173 INFO L93 Difference]: Finished difference Result 174 states and 175 transitions. [2022-07-23 05:43:01,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-07-23 05:43:01,173 INFO L78 Accepts]: Start accepts. Automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 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 104 [2022-07-23 05:43:01,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 05:43:01,174 INFO L225 Difference]: With dead ends: 174 [2022-07-23 05:43:01,174 INFO L226 Difference]: Without dead ends: 112 [2022-07-23 05:43:01,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 138 SyntacticMatches, 10 SemanticMatches, 146 ConstructedPredicates, 21 IntricatePredicates, 5 DeprecatedPredicates, 3480 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=539, Invalid=15525, Unknown=22, NotChecked=5670, Total=21756 [2022-07-23 05:43:01,175 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 25 mSDsluCounter, 2165 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 2802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1940 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 05:43:01,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2205 Invalid, 2802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 859 Invalid, 0 Unknown, 1940 Unchecked, 0.3s Time] [2022-07-23 05:43:01,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-23 05:43:01,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 109. [2022-07-23 05:43:01,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 108 states have (on average 1.0185185185185186) internal successors, (110), 108 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:01,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 110 transitions. [2022-07-23 05:43:01,178 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 110 transitions. Word has length 104 [2022-07-23 05:43:01,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 05:43:01,178 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 110 transitions. [2022-07-23 05:43:01,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 117 states, 117 states have (on average 2.452991452991453) internal successors, (287), 117 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 05:43:01,178 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-07-23 05:43:01,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-23 05:43:01,179 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 05:43:01,179 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 05:43:01,201 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-23 05:43:01,383 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,SelfDestructingSolverStorable43 [2022-07-23 05:43:01,383 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 20 more)] === [2022-07-23 05:43:01,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 05:43:01,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1020694645, now seen corresponding path program 17 times [2022-07-23 05:43:01,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 05:43:01,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72919730] [2022-07-23 05:43:01,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 05:43:01,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 05:43:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 05:43:01,895 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 91 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:01,896 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 05:43:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72919730] [2022-07-23 05:43:01,896 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72919730] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 05:43:01,896 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [759261970] [2022-07-23 05:43:01,896 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-23 05:43:01,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 05:43:01,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 05:43:01,897 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-23 05:43:01,898 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-23 05:43:14,576 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-23 05:43:14,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-23 05:43:14,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 764 conjuncts, 113 conjunts are in the unsatisfiable core [2022-07-23 05:43:14,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 05:43:14,616 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:14,616 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-23 05:43:14,628 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-23 05:43:14,628 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-23 05:43:15,107 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-23 05:43:15,109 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-23 05:43:15,114 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-23 05:43:15,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 11 treesize of output 11 [2022-07-23 05:43:15,523 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 120 proven. 267 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-23 05:43:15,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 05:43:22,234 WARN L233 SmtUtils]: Spent 6.08s on a formula simplification that was a NOOP. DAG size: 24 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)