./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 16:57:53,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 16:57:53,400 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 16:57:53,430 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 16:57:53,431 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 16:57:53,432 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 16:57:53,435 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 16:57:53,437 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 16:57:53,439 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 16:57:53,442 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 16:57:53,443 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 16:57:53,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 16:57:53,444 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 16:57:53,446 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 16:57:53,447 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 16:57:53,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 16:57:53,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 16:57:53,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 16:57:53,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 16:57:53,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 16:57:53,456 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 16:57:53,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 16:57:53,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 16:57:53,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 16:57:53,459 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 16:57:53,461 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 16:57:53,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 16:57:53,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 16:57:53,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 16:57:53,466 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 16:57:53,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 16:57:53,467 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 16:57:53,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 16:57:53,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 16:57:53,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 16:57:53,471 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 16:57:53,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 16:57:53,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 16:57:53,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 16:57:53,471 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 16:57:53,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 16:57:53,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 16:57:53,475 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-21 16:57:53,505 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 16:57:53,505 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 16:57:53,506 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 16:57:53,506 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 16:57:53,506 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 16:57:53,507 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 16:57:53,507 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 16:57:53,507 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 16:57:53,508 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 16:57:53,508 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 16:57:53,509 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-21 16:57:53,514 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-21 16:57:53,514 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-21 16:57:53,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 16:57:53,515 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-21 16:57:53,515 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-21 16:57:53,515 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 16:57:53,515 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 16:57:53,516 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 16:57:53,516 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 16:57:53,516 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:57:53,516 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 16:57:53,516 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 16:57:53,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 16:57:53,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 16:57:53,517 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 57855fd15a600148bf8b2d693e60ae0827a95c157ed69e07e1c42c75fda7c9c4 [2022-07-21 16:57:53,808 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 16:57:53,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 16:57:53,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 16:57:53,831 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 16:57:53,833 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 16:57:53,835 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-21 16:57:53,904 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259983e9/4eeafa119afa49ec93ae3b6214376e12/FLAG303dd334b [2022-07-21 16:57:54,277 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 16:57:54,277 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/openbsd_cstrncpy-alloca-2.i [2022-07-21 16:57:54,289 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259983e9/4eeafa119afa49ec93ae3b6214376e12/FLAG303dd334b [2022-07-21 16:57:54,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b259983e9/4eeafa119afa49ec93ae3b6214376e12 [2022-07-21 16:57:54,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 16:57:54,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 16:57:54,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 16:57:54,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 16:57:54,310 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 16:57:54,311 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,312 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5182bd76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54, skipping insertion in model container [2022-07-21 16:57:54,313 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,318 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 16:57:54,356 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 16:57:54,630 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:57:54,637 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 16:57:54,672 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 16:57:54,696 INFO L208 MainTranslator]: Completed translation [2022-07-21 16:57:54,697 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54 WrapperNode [2022-07-21 16:57:54,697 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 16:57:54,698 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 16:57:54,698 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 16:57:54,699 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 16:57:54,704 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,721 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,743 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 85 [2022-07-21 16:57:54,743 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 16:57:54,744 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 16:57:54,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 16:57:54,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 16:57:54,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,760 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,760 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,763 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,766 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,766 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,768 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 16:57:54,769 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 16:57:54,769 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 16:57:54,769 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 16:57:54,769 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (1/1) ... [2022-07-21 16:57:54,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 16:57:54,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:54,794 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-21 16:57:54,798 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-21 16:57:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 16:57:54,830 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 16:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 16:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 16:57:54,831 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 16:57:54,831 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 16:57:54,964 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 16:57:54,970 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 16:57:55,176 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 16:57:55,180 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 16:57:55,181 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-21 16:57:55,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:57:55 BoogieIcfgContainer [2022-07-21 16:57:55,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 16:57:55,183 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 16:57:55,184 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 16:57:55,186 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 16:57:55,186 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 04:57:54" (1/3) ... [2022-07-21 16:57:55,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3520df66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:57:55, skipping insertion in model container [2022-07-21 16:57:55,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 04:57:54" (2/3) ... [2022-07-21 16:57:55,187 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3520df66 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 04:57:55, skipping insertion in model container [2022-07-21 16:57:55,187 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 04:57:55" (3/3) ... [2022-07-21 16:57:55,188 INFO L111 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca-2.i [2022-07-21 16:57:55,200 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 16:57:55,200 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-21 16:57:55,243 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 16:57:55,249 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@38eb0e05, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4911d5fd [2022-07-21 16:57:55,249 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-21 16:57:55,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:57:55,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:55,257 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:55,258 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:55,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:55,263 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-21 16:57:55,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:55,271 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168226117] [2022-07-21 16:57:55,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:55,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:55,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:55,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-21 16:57:55,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:55,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168226117] [2022-07-21 16:57:55,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168226117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:55,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:55,445 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-21 16:57:55,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301788705] [2022-07-21 16:57:55,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 16:57:55,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 16:57:55,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-21 16:57:55,475 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.8076923076923077) internal successors, (47), 37 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:55,516 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2022-07-21 16:57:55,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 16:57:55,519 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-21 16:57:55,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:55,524 INFO L225 Difference]: With dead ends: 36 [2022-07-21 16:57:55,524 INFO L226 Difference]: Without dead ends: 34 [2022-07-21 16:57:55,527 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-21 16:57:55,530 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 30 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:55,531 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 35 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:55,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-21 16:57:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-21 16:57:55,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.6) internal successors, (40), 33 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-07-21 16:57:55,565 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 7 [2022-07-21 16:57:55,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:55,566 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-07-21 16:57:55,566 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,566 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-07-21 16:57:55,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:57:55,567 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:55,567 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:55,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 16:57:55,567 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:55,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:55,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-21 16:57:55,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:55,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672356033] [2022-07-21 16:57:55,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:55,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:55,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:55,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:55,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672356033] [2022-07-21 16:57:55,623 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672356033] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:55,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:55,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:57:55,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722157036] [2022-07-21 16:57:55,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:57:55,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:57:55,633 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:57:55,633 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:55,666 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-21 16:57:55,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:57:55,666 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-21 16:57:55,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:55,667 INFO L225 Difference]: With dead ends: 33 [2022-07-21 16:57:55,667 INFO L226 Difference]: Without dead ends: 33 [2022-07-21 16:57:55,667 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-21 16:57:55,668 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 65 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:55,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 29 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:55,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-21 16:57:55,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-21 16:57:55,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 25 states have (on average 1.56) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-21 16:57:55,675 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-21 16:57:55,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:55,675 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-21 16:57:55,675 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-21 16:57:55,676 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-21 16:57:55,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:57:55,676 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:55,677 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:55,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 16:57:55,678 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:55,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:55,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-21 16:57:55,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:55,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046531354] [2022-07-21 16:57:55,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:55,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:55,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:55,732 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-21 16:57:55,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:55,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046531354] [2022-07-21 16:57:55,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046531354] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:55,735 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:55,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:57:55,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115227259] [2022-07-21 16:57:55,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:57:55,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:57:55,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:57:55,738 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:55,764 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2022-07-21 16:57:55,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:57:55,765 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-21 16:57:55,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:55,766 INFO L225 Difference]: With dead ends: 59 [2022-07-21 16:57:55,766 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:57:55,767 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-21 16:57:55,771 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 56 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:55,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 70 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:55,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:57:55,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 36. [2022-07-21 16:57:55,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 28 states have (on average 1.5357142857142858) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-21 16:57:55,777 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 7 [2022-07-21 16:57:55,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:55,778 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-21 16:57:55,778 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-21 16:57:55,778 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-21 16:57:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-21 16:57:55,779 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:55,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:55,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 16:57:55,780 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:55,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:55,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-21 16:57:55,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:55,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107277014] [2022-07-21 16:57:55,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:55,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:55,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:55,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:55,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:55,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107277014] [2022-07-21 16:57:55,838 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1107277014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:55,838 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:55,838 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:57:55,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724176637] [2022-07-21 16:57:55,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,840 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:57:55,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:57:55,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:55,842 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:55,909 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-07-21 16:57:55,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:57:55,909 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-21 16:57:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:55,912 INFO L225 Difference]: With dead ends: 63 [2022-07-21 16:57:55,913 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 16:57:55,914 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-21 16:57:55,915 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 64 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:55,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 73 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:57:55,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 16:57:55,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 38. [2022-07-21 16:57:55,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 30 states have (on average 1.5333333333333334) internal successors, (46), 37 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:55,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2022-07-21 16:57:55,919 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 7 [2022-07-21 16:57:55,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:55,919 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2022-07-21 16:57:55,919 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-21 16:57:55,919 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-07-21 16:57:55,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:57:55,920 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:55,920 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:55,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 16:57:55,920 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:55,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:55,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751785, now seen corresponding path program 1 times [2022-07-21 16:57:55,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:55,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025120509] [2022-07-21 16:57:55,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:55,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:55,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:55,982 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-21 16:57:55,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:55,982 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025120509] [2022-07-21 16:57:55,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025120509] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:55,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:55,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:57:55,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837269407] [2022-07-21 16:57:55,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:55,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 16:57:55,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:55,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 16:57:55,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:57:55,985 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:56,070 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2022-07-21 16:57:56,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:57:56,070 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:57:56,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:56,072 INFO L225 Difference]: With dead ends: 39 [2022-07-21 16:57:56,072 INFO L226 Difference]: Without dead ends: 39 [2022-07-21 16:57:56,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:57:56,076 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 70 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:56,077 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 67 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-21 16:57:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2022-07-21 16:57:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.5) internal successors, (45), 36 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2022-07-21 16:57:56,081 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 11 [2022-07-21 16:57:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:56,081 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2022-07-21 16:57:56,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-07-21 16:57:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:57:56,082 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:56,082 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:56,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 16:57:56,082 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:56,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:56,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1954751784, now seen corresponding path program 1 times [2022-07-21 16:57:56,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:56,083 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938398735] [2022-07-21 16:57:56,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:56,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:56,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:56,162 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-21 16:57:56,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:56,162 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938398735] [2022-07-21 16:57:56,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938398735] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:56,163 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:56,163 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 16:57:56,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194902773] [2022-07-21 16:57:56,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:56,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 16:57:56,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:56,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 16:57:56,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-21 16:57:56,165 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:56,256 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2022-07-21 16:57:56,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:57:56,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-21 16:57:56,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:56,260 INFO L225 Difference]: With dead ends: 43 [2022-07-21 16:57:56,260 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:57:56,260 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2022-07-21 16:57:56,262 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 144 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:56,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 83 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:56,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:57:56,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2022-07-21 16:57:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.46875) internal successors, (47), 38 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-07-21 16:57:56,275 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 11 [2022-07-21 16:57:56,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:56,276 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-07-21 16:57:56,276 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.5714285714285714) internal successors, (11), 8 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-07-21 16:57:56,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-21 16:57:56,277 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:56,277 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:56,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 16:57:56,277 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:56,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:56,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-21 16:57:56,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:56,279 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399647014] [2022-07-21 16:57:56,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:56,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:56,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:56,339 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-21 16:57:56,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399647014] [2022-07-21 16:57:56,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399647014] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:56,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971116996] [2022-07-21 16:57:56,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:56,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:56,340 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:56,341 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-21 16:57:56,359 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-21 16:57:56,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:56,390 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-21 16:57:56,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:56,461 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:57:56,461 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-21 16:57:56,531 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-21 16:57:56,531 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:56,683 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-21 16:57:56,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971116996] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:56,685 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:56,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 9 [2022-07-21 16:57:56,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216968751] [2022-07-21 16:57:56,686 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:56,687 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:57:56,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:56,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:57:56,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:57:56,688 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:56,801 INFO L93 Difference]: Finished difference Result 89 states and 104 transitions. [2022-07-21 16:57:56,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:57:56,802 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-21 16:57:56,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:56,803 INFO L225 Difference]: With dead ends: 89 [2022-07-21 16:57:56,803 INFO L226 Difference]: Without dead ends: 89 [2022-07-21 16:57:56,803 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-21 16:57:56,804 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 165 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:56,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 201 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:57:56,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-21 16:57:56,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 36. [2022-07-21 16:57:56,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 35 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:56,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-07-21 16:57:56,806 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 11 [2022-07-21 16:57:56,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:56,807 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-07-21 16:57:56,807 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-21 16:57:56,807 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-07-21 16:57:56,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:57:56,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:56,807 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:56,836 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-21 16:57:57,036 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-21 16:57:57,037 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,037 INFO L85 PathProgramCache]: Analyzing trace with hash -466410634, now seen corresponding path program 1 times [2022-07-21 16:57:57,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273676303] [2022-07-21 16:57:57,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,094 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-21 16:57:57,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273676303] [2022-07-21 16:57:57,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273676303] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:57:57,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65083605] [2022-07-21 16:57:57,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:57:57,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:57:57,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:57:57,096 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,123 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2022-07-21 16:57:57,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:57:57,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 16:57:57,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,124 INFO L225 Difference]: With dead ends: 73 [2022-07-21 16:57:57,124 INFO L226 Difference]: Without dead ends: 73 [2022-07-21 16:57:57,124 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:57,125 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 108 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-07-21 16:57:57,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 46. [2022-07-21 16:57:57,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 40 states have (on average 1.35) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-21 16:57:57,128 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-21 16:57:57,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,128 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-21 16:57:57,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,128 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-21 16:57:57,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:57:57,129 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,129 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 16:57:57,129 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,130 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,130 INFO L85 PathProgramCache]: Analyzing trace with hash -467763174, now seen corresponding path program 1 times [2022-07-21 16:57:57,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471766054] [2022-07-21 16:57:57,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,181 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-21 16:57:57,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,182 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471766054] [2022-07-21 16:57:57,182 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471766054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,182 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:57:57,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020271603] [2022-07-21 16:57:57,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:57:57,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:57:57,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:57:57,184 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,231 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2022-07-21 16:57:57,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:57:57,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 16:57:57,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,232 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:57:57,232 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 16:57:57,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:57:57,234 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 62 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 64 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 16:57:57,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 45. [2022-07-21 16:57:57,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 40 states have (on average 1.325) internal successors, (53), 44 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 53 transitions. [2022-07-21 16:57:57,240 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 53 transitions. Word has length 12 [2022-07-21 16:57:57,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,240 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 53 transitions. [2022-07-21 16:57:57,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,241 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 53 transitions. [2022-07-21 16:57:57,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:57:57,241 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,242 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,242 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 16:57:57,242 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,243 INFO L85 PathProgramCache]: Analyzing trace with hash -467763173, now seen corresponding path program 1 times [2022-07-21 16:57:57,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568706240] [2022-07-21 16:57:57,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,332 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-21 16:57:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568706240] [2022-07-21 16:57:57,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568706240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 16:57:57,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34142291] [2022-07-21 16:57:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 16:57:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 16:57:57,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:57:57,334 INFO L87 Difference]: Start difference. First operand 45 states and 53 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,417 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-07-21 16:57:57,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 16:57:57,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 16:57:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,418 INFO L225 Difference]: With dead ends: 47 [2022-07-21 16:57:57,418 INFO L226 Difference]: Without dead ends: 47 [2022-07-21 16:57:57,418 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2022-07-21 16:57:57,420 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 92 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,421 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 84 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-07-21 16:57:57,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2022-07-21 16:57:57,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.3170731707317074) internal successors, (54), 45 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 54 transitions. [2022-07-21 16:57:57,430 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 54 transitions. Word has length 12 [2022-07-21 16:57:57,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,431 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 54 transitions. [2022-07-21 16:57:57,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,431 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 54 transitions. [2022-07-21 16:57:57,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-21 16:57:57,432 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,432 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 16:57:57,433 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,433 INFO L85 PathProgramCache]: Analyzing trace with hash 213647736, now seen corresponding path program 1 times [2022-07-21 16:57:57,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539901565] [2022-07-21 16:57:57,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:57:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539901565] [2022-07-21 16:57:57,493 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539901565] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:57:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749902614] [2022-07-21 16:57:57,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,494 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:57:57,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:57:57,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:57,495 INFO L87 Difference]: Start difference. First operand 46 states and 54 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,516 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2022-07-21 16:57:57,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:57:57,516 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-07-21 16:57:57,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,517 INFO L225 Difference]: With dead ends: 49 [2022-07-21 16:57:57,517 INFO L226 Difference]: Without dead ends: 49 [2022-07-21 16:57:57,517 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-21 16:57:57,518 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 73 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 59 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-07-21 16:57:57,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 36. [2022-07-21 16:57:57,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-07-21 16:57:57,520 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 12 [2022-07-21 16:57:57,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,520 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-07-21 16:57:57,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,521 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-07-21 16:57:57,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:57:57,521 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,521 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,521 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 16:57:57,522 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,522 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901600, now seen corresponding path program 1 times [2022-07-21 16:57:57,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616347751] [2022-07-21 16:57:57,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,579 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-21 16:57:57,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616347751] [2022-07-21 16:57:57,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616347751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-21 16:57:57,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111188765] [2022-07-21 16:57:57,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:57:57,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:57:57,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:57,583 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,618 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-07-21 16:57:57,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 16:57:57,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 16:57:57,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,619 INFO L225 Difference]: With dead ends: 35 [2022-07-21 16:57:57,619 INFO L226 Difference]: Without dead ends: 35 [2022-07-21 16:57:57,619 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-21 16:57:57,620 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 76 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-21 16:57:57,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-21 16:57:57,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 34 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-07-21 16:57:57,622 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 16 [2022-07-21 16:57:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,622 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-07-21 16:57:57,622 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,622 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-07-21 16:57:57,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:57:57,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,625 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 16:57:57,625 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1302901599, now seen corresponding path program 1 times [2022-07-21 16:57:57,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484161592] [2022-07-21 16:57:57,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,713 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-21 16:57:57,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484161592] [2022-07-21 16:57:57,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484161592] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:57:57,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543067962] [2022-07-21 16:57:57,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:57:57,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:57:57,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:57,714 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:57,744 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-07-21 16:57:57,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:57:57,745 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 16:57:57,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:57,745 INFO L225 Difference]: With dead ends: 69 [2022-07-21 16:57:57,745 INFO L226 Difference]: Without dead ends: 69 [2022-07-21 16:57:57,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:57:57,746 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 31 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:57,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 128 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:57,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-21 16:57:57,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-21 16:57:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 47 states have (on average 1.2553191489361701) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-21 16:57:57,747 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 16 [2022-07-21 16:57:57,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:57,748 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-21 16:57:57,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:57,748 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-21 16:57:57,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-21 16:57:57,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:57,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:57,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 16:57:57,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1889707613, now seen corresponding path program 1 times [2022-07-21 16:57:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:57,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101304096] [2022-07-21 16:57:57,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:57,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:57,908 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-21 16:57:57,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:57,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101304096] [2022-07-21 16:57:57,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101304096] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:57,908 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:57,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 16:57:57,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614487836] [2022-07-21 16:57:57,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:57,909 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:57:57,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:57,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:57:57,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:57:57,910 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,064 INFO L93 Difference]: Finished difference Result 57 states and 67 transitions. [2022-07-21 16:57:58,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:57:58,065 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-07-21 16:57:58,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,066 INFO L225 Difference]: With dead ends: 57 [2022-07-21 16:57:58,066 INFO L226 Difference]: Without dead ends: 57 [2022-07-21 16:57:58,066 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-21 16:57:58,066 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 74 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,067 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 110 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:57:58,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-21 16:57:58,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-21 16:57:58,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 54 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 65 transitions. [2022-07-21 16:57:58,069 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 65 transitions. Word has length 16 [2022-07-21 16:57:58,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,069 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 65 transitions. [2022-07-21 16:57:58,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,069 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 65 transitions. [2022-07-21 16:57:58,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 16:57:58,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,070 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:58,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 16:57:58,070 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:58,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,070 INFO L85 PathProgramCache]: Analyzing trace with hash -1717205610, now seen corresponding path program 1 times [2022-07-21 16:57:58,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1489598425] [2022-07-21 16:57:58,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:58,117 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-21 16:57:58,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:58,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1489598425] [2022-07-21 16:57:58,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1489598425] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:58,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:58,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-21 16:57:58,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822601199] [2022-07-21 16:57:58,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:58,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-21 16:57:58,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:58,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-21 16:57:58,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-21 16:57:58,119 INFO L87 Difference]: Start difference. First operand 55 states and 65 transitions. Second operand has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,150 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-07-21 16:57:58,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-21 16:57:58,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 16:57:58,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,151 INFO L225 Difference]: With dead ends: 61 [2022-07-21 16:57:58,151 INFO L226 Difference]: Without dead ends: 61 [2022-07-21 16:57:58,153 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-07-21 16:57:58,153 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 16 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 112 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:58,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-21 16:57:58,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 57. [2022-07-21 16:57:58,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 53 states have (on average 1.2641509433962264) internal successors, (67), 56 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 67 transitions. [2022-07-21 16:57:58,156 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 67 transitions. Word has length 17 [2022-07-21 16:57:58,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,156 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 67 transitions. [2022-07-21 16:57:58,156 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 67 transitions. [2022-07-21 16:57:58,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 16:57:58,157 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,157 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:58,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 16:57:58,158 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:58,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1566644436, now seen corresponding path program 1 times [2022-07-21 16:57:58,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317705856] [2022-07-21 16:57:58,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:58,262 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-21 16:57:58,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:58,262 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317705856] [2022-07-21 16:57:58,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317705856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:58,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:58,263 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 16:57:58,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534757487] [2022-07-21 16:57:58,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:58,263 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 16:57:58,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:58,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 16:57:58,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 16:57:58,264 INFO L87 Difference]: Start difference. First operand 57 states and 67 transitions. Second operand has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,394 INFO L93 Difference]: Finished difference Result 85 states and 96 transitions. [2022-07-21 16:57:58,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 16:57:58,395 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 16:57:58,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,395 INFO L225 Difference]: With dead ends: 85 [2022-07-21 16:57:58,395 INFO L226 Difference]: Without dead ends: 85 [2022-07-21 16:57:58,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=125, Unknown=0, NotChecked=0, Total=182 [2022-07-21 16:57:58,396 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 170 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:58,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-07-21 16:57:58,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 71. [2022-07-21 16:57:58,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 67 states have (on average 1.208955223880597) internal successors, (81), 70 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 81 transitions. [2022-07-21 16:57:58,399 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 81 transitions. Word has length 17 [2022-07-21 16:57:58,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,399 INFO L495 AbstractCegarLoop]: Abstraction has 71 states and 81 transitions. [2022-07-21 16:57:58,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.8888888888888888) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,399 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 81 transitions. [2022-07-21 16:57:58,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-21 16:57:58,400 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,400 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:58,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 16:57:58,401 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:58,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,401 INFO L85 PathProgramCache]: Analyzing trace with hash 286780758, now seen corresponding path program 1 times [2022-07-21 16:57:58,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734729920] [2022-07-21 16:57:58,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:58,508 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-21 16:57:58,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:58,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734729920] [2022-07-21 16:57:58,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734729920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:58,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:58,509 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 16:57:58,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644808666] [2022-07-21 16:57:58,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:58,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 16:57:58,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:58,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 16:57:58,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-21 16:57:58,510 INFO L87 Difference]: Start difference. First operand 71 states and 81 transitions. Second operand has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,639 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-21 16:57:58,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 16:57:58,640 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-21 16:57:58,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,640 INFO L225 Difference]: With dead ends: 107 [2022-07-21 16:57:58,640 INFO L226 Difference]: Without dead ends: 107 [2022-07-21 16:57:58,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2022-07-21 16:57:58,641 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 79 mSDsluCounter, 155 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,641 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 176 Invalid, 116 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:57:58,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-21 16:57:58,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 73. [2022-07-21 16:57:58,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 72 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 85 transitions. [2022-07-21 16:57:58,643 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 85 transitions. Word has length 17 [2022-07-21 16:57:58,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,643 INFO L495 AbstractCegarLoop]: Abstraction has 73 states and 85 transitions. [2022-07-21 16:57:58,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.7) internal successors, (17), 10 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,644 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 85 transitions. [2022-07-21 16:57:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-21 16:57:58,644 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,644 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-21 16:57:58,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 16:57:58,644 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:58,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2041976217, now seen corresponding path program 1 times [2022-07-21 16:57:58,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647488455] [2022-07-21 16:57:58,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:58,684 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-21 16:57:58,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:58,685 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647488455] [2022-07-21 16:57:58,685 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647488455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 16:57:58,685 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 16:57:58,685 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-21 16:57:58,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749463858] [2022-07-21 16:57:58,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 16:57:58,686 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-21 16:57:58,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:58,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-21 16:57:58,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:57:58,686 INFO L87 Difference]: Start difference. First operand 73 states and 85 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:57:58,697 INFO L93 Difference]: Finished difference Result 72 states and 84 transitions. [2022-07-21 16:57:58,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-21 16:57:58,698 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-21 16:57:58,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:57:58,698 INFO L225 Difference]: With dead ends: 72 [2022-07-21 16:57:58,699 INFO L226 Difference]: Without dead ends: 43 [2022-07-21 16:57:58,699 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-21 16:57:58,699 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 16:57:58,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 50 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 16:57:58,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-21 16:57:58,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-21 16:57:58,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 40 states have (on average 1.2) internal successors, (48), 42 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-07-21 16:57:58,701 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 18 [2022-07-21 16:57:58,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:57:58,701 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-07-21 16:57:58,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:57:58,701 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-07-21 16:57:58,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-21 16:57:58,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:57:58,702 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:57:58,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 16:57:58,702 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:57:58,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:57:58,702 INFO L85 PathProgramCache]: Analyzing trace with hash -2012971173, now seen corresponding path program 1 times [2022-07-21 16:57:58,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:57:58,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087264735] [2022-07-21 16:57:58,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:57:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:58,939 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-21 16:57:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:57:58,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087264735] [2022-07-21 16:57:58,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087264735] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:57:58,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215044103] [2022-07-21 16:57:58,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:57:58,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:57:58,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:57:58,941 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-21 16:57:58,942 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-21 16:57:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:57:59,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 16:57:59,009 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:57:59,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:57:59,024 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-21 16:57:59,030 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-21 16:57:59,262 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-21 16:57:59,263 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:57:59,625 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-21 16:57:59,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1215044103] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:57:59,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:57:59,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-21 16:57:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571554630] [2022-07-21 16:57:59,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:57:59,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 16:57:59,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:57:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 16:57:59,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=718, Unknown=0, NotChecked=0, Total=812 [2022-07-21 16:57:59,629 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:00,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:00,899 INFO L93 Difference]: Finished difference Result 84 states and 91 transitions. [2022-07-21 16:58:00,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-07-21 16:58:00,899 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-21 16:58:00,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:00,899 INFO L225 Difference]: With dead ends: 84 [2022-07-21 16:58:00,900 INFO L226 Difference]: Without dead ends: 61 [2022-07-21 16:58:00,901 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=432, Invalid=2648, Unknown=0, NotChecked=0, Total=3080 [2022-07-21 16:58:00,901 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 358 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 358 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:00,901 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 252 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 358 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:58:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-21 16:58:00,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 52. [2022-07-21 16:58:00,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:00,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2022-07-21 16:58:00,902 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 20 [2022-07-21 16:58:00,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:00,902 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2022-07-21 16:58:00,903 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.6785714285714286) internal successors, (47), 29 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:00,903 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2022-07-21 16:58:00,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-21 16:58:00,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:00,903 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:00,928 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:01,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:01,104 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:01,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:01,104 INFO L85 PathProgramCache]: Analyzing trace with hash -718716967, now seen corresponding path program 1 times [2022-07-21 16:58:01,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:01,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329064331] [2022-07-21 16:58:01,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:01,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:01,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:01,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:01,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:01,227 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329064331] [2022-07-21 16:58:01,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329064331] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:01,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [50597867] [2022-07-21 16:58:01,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:01,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:01,228 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:01,229 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-21 16:58:01,261 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-21 16:58:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:01,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-21 16:58:01,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:01,392 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-21 16:58:01,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:01,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:58:01,527 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-21 16:58:01,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [50597867] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:01,527 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:01,528 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 22 [2022-07-21 16:58:01,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186999467] [2022-07-21 16:58:01,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:01,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-07-21 16:58:01,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:01,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-07-21 16:58:01,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2022-07-21 16:58:01,529 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:01,728 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2022-07-21 16:58:01,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 16:58:01,729 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-07-21 16:58:01,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:01,729 INFO L225 Difference]: With dead ends: 56 [2022-07-21 16:58:01,729 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 16:58:01,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=690, Unknown=0, NotChecked=0, Total=870 [2022-07-21 16:58:01,730 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 255 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:01,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 95 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:58:01,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 16:58:01,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 52. [2022-07-21 16:58:01,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2244897959183674) internal successors, (60), 51 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:01,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2022-07-21 16:58:01,731 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 21 [2022-07-21 16:58:01,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:01,731 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2022-07-21 16:58:01,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.9545454545454546) internal successors, (43), 23 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:01,731 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2022-07-21 16:58:01,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-21 16:58:01,732 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:01,732 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:01,751 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-21 16:58:01,932 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:01,932 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:01,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:01,933 INFO L85 PathProgramCache]: Analyzing trace with hash -805389510, now seen corresponding path program 1 times [2022-07-21 16:58:01,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:01,933 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953611134] [2022-07-21 16:58:01,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:01,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:01,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:02,060 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-21 16:58:02,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953611134] [2022-07-21 16:58:02,060 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953611134] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:02,060 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442775489] [2022-07-21 16:58:02,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:02,060 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:02,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:02,062 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-21 16:58:02,063 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-21 16:58:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:02,124 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-21 16:58:02,128 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:02,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:02,143 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 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-21 16:58:02,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:58:02,374 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-21 16:58:02,375 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:02,621 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:58:02,647 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-21 16:58:02,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442775489] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:02,648 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:02,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 27 [2022-07-21 16:58:02,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134542007] [2022-07-21 16:58:02,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:02,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-21 16:58:02,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:02,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-21 16:58:02,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2022-07-21 16:58:02,649 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:02,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:02,901 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2022-07-21 16:58:02,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 16:58:02,901 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-21 16:58:02,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:02,902 INFO L225 Difference]: With dead ends: 52 [2022-07-21 16:58:02,902 INFO L226 Difference]: Without dead ends: 52 [2022-07-21 16:58:02,902 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 16:58:02,903 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:02,903 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 113 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 167 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-21 16:58:02,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-21 16:58:02,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-21 16:58:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2040816326530612) internal successors, (59), 51 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 59 transitions. [2022-07-21 16:58:02,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 59 transitions. Word has length 22 [2022-07-21 16:58:02,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:02,905 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 59 transitions. [2022-07-21 16:58:02,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.185185185185185) internal successors, (59), 28 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:02,905 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 59 transitions. [2022-07-21 16:58:02,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-21 16:58:02,905 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:02,905 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:02,936 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-21 16:58:03,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:03,106 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:03,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:03,106 INFO L85 PathProgramCache]: Analyzing trace with hash -279519168, now seen corresponding path program 1 times [2022-07-21 16:58:03,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:03,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312187322] [2022-07-21 16:58:03,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:03,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:03,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:03,270 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-21 16:58:03,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312187322] [2022-07-21 16:58:03,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312187322] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:03,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089567638] [2022-07-21 16:58:03,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:03,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:03,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:03,271 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-21 16:58:03,272 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-21 16:58:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:03,331 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 16:58:03,333 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:03,339 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:03,340 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-21 16:58:03,342 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-21 16:58:03,569 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-21 16:58:03,569 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:03,987 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-21 16:58:03,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089567638] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:03,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:03,988 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2022-07-21 16:58:03,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483100899] [2022-07-21 16:58:03,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:03,988 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-21 16:58:03,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:03,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-21 16:58:03,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=714, Unknown=0, NotChecked=0, Total=812 [2022-07-21 16:58:03,989 INFO L87 Difference]: Start difference. First operand 52 states and 59 transitions. Second operand has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:04,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:04,687 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2022-07-21 16:58:04,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-21 16:58:04,689 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-07-21 16:58:04,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:04,689 INFO L225 Difference]: With dead ends: 51 [2022-07-21 16:58:04,689 INFO L226 Difference]: Without dead ends: 37 [2022-07-21 16:58:04,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=297, Invalid=1773, Unknown=0, NotChecked=0, Total=2070 [2022-07-21 16:58:04,690 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 62 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:04,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 227 Invalid, 348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:58:04,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-07-21 16:58:04,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-07-21 16:58:04,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:04,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2022-07-21 16:58:04,691 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2022-07-21 16:58:04,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:04,691 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2022-07-21 16:58:04,691 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 29 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:04,691 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2022-07-21 16:58:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-21 16:58:04,692 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:04,692 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:04,715 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-21 16:58:04,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-07-21 16:58:04,892 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:04,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:04,893 INFO L85 PathProgramCache]: Analyzing trace with hash -57121321, now seen corresponding path program 2 times [2022-07-21 16:58:04,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:04,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913588705] [2022-07-21 16:58:04,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:04,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:04,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:05,126 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-21 16:58:05,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913588705] [2022-07-21 16:58:05,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913588705] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:05,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829610252] [2022-07-21 16:58:05,127 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:58:05,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:05,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:05,128 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-21 16:58:05,138 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-21 16:58:05,197 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:58:05,197 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:05,198 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 57 conjunts are in the unsatisfiable core [2022-07-21 16:58:05,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:05,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:58:05,247 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-21 16:58:05,464 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 16:58:05,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:05,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:58:05,722 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:05,722 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:05,995 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 16:58:06,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_280) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)))) is different from false [2022-07-21 16:58:06,045 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_280 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_280) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27| 1)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_27|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-21 16:58:06,056 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:06,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:06,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:06,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:58:06,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 16:58:06,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:06,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 16:58:06,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829610252] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:06,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:06,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 38 [2022-07-21 16:58:06,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428017999] [2022-07-21 16:58:06,184 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:06,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-21 16:58:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-21 16:58:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1079, Unknown=4, NotChecked=204, Total=1406 [2022-07-21 16:58:06,186 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:06,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:06,804 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2022-07-21 16:58:06,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:58:06,804 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-21 16:58:06,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:06,804 INFO L225 Difference]: With dead ends: 58 [2022-07-21 16:58:06,804 INFO L226 Difference]: Without dead ends: 45 [2022-07-21 16:58:06,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 355 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=253, Invalid=2107, Unknown=4, NotChecked=288, Total=2652 [2022-07-21 16:58:06,806 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 58 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 218 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:06,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 263 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 217 Invalid, 0 Unknown, 218 Unchecked, 0.1s Time] [2022-07-21 16:58:06,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-07-21 16:58:06,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2022-07-21 16:58:06,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 37 states have (on average 1.0810810810810811) internal successors, (40), 38 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:06,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-07-21 16:58:06,807 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 27 [2022-07-21 16:58:06,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:06,807 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-07-21 16:58:06,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.9210526315789473) internal successors, (73), 38 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-07-21 16:58:06,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-21 16:58:06,807 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:06,807 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:06,847 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-21 16:58:07,015 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:07,015 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:07,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:07,016 INFO L85 PathProgramCache]: Analyzing trace with hash 614687385, now seen corresponding path program 2 times [2022-07-21 16:58:07,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:07,016 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060104080] [2022-07-21 16:58:07,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:07,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:07,259 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-21 16:58:07,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:07,259 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060104080] [2022-07-21 16:58:07,260 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060104080] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:07,260 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1674473683] [2022-07-21 16:58:07,260 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:58:07,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:07,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:07,261 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-21 16:58:07,261 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-21 16:58:07,350 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:58:07,350 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:07,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 16:58:07,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:07,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:07,373 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-21 16:58:07,377 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-21 16:58:07,696 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-21 16:58:07,696 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:08,178 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-21 16:58:08,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1674473683] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:08,178 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:08,178 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 32 [2022-07-21 16:58:08,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347888456] [2022-07-21 16:58:08,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:08,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-21 16:58:08,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:08,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-21 16:58:08,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=941, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 16:58:08,180 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:09,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:09,131 INFO L93 Difference]: Finished difference Result 54 states and 55 transitions. [2022-07-21 16:58:09,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-21 16:58:09,131 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-21 16:58:09,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:09,131 INFO L225 Difference]: With dead ends: 54 [2022-07-21 16:58:09,132 INFO L226 Difference]: Without dead ends: 54 [2022-07-21 16:58:09,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 499 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=349, Invalid=2407, Unknown=0, NotChecked=0, Total=2756 [2022-07-21 16:58:09,133 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:09,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 161 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:58:09,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-21 16:58:09,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-21 16:58:09,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 50 states have (on average 1.1) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:09,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2022-07-21 16:58:09,134 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 32 [2022-07-21 16:58:09,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:09,135 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2022-07-21 16:58:09,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.09375) internal successors, (67), 33 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:09,135 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2022-07-21 16:58:09,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-21 16:58:09,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:09,135 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:09,152 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-21 16:58:09,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:09,353 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:09,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:09,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1981775400, now seen corresponding path program 3 times [2022-07-21 16:58:09,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:09,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583047197] [2022-07-21 16:58:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:09,598 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-21 16:58:09,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583047197] [2022-07-21 16:58:09,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583047197] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:09,598 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1168473009] [2022-07-21 16:58:09,598 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:58:09,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:09,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:09,599 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-21 16:58:09,601 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-21 16:58:09,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-21 16:58:09,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:09,696 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 74 conjunts are in the unsatisfiable core [2022-07-21 16:58:09,697 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:09,830 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-21 16:58:10,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:10,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 16:58:10,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 16:58:10,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-21 16:58:10,223 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:58:10,224 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:10,225 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-21 16:58:10,227 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-21 16:58:10,227 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:21,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-21 16:58:22,162 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-21 16:58:23,270 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) is different from false [2022-07-21 16:58:23,275 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 372 treesize of output 360 [2022-07-21 16:58:23,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-21 16:58:23,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1168473009] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:23,593 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:23,593 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 16, 16] total 42 [2022-07-21 16:58:23,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244059642] [2022-07-21 16:58:23,593 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:23,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:58:23,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:23,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:58:23,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=1360, Unknown=14, NotChecked=228, Total=1722 [2022-07-21 16:58:23,594 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:24,308 WARN L833 $PredicateComparison]: unable to prove that (and (= 0 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) (< 2 |c_ULTIMATE.start_main_~length~0#1|) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_main_~nondetArea~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< (+ 1 |c_ULTIMATE.start_main_~nondetArea~0#1.offset|) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (<= 3 |c_ULTIMATE.start_main_~length~0#1|) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1| |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0) (<= |c_ULTIMATE.start_main_~length~0#1| 3) (not (= |c_ULTIMATE.start_main_~nondetString~0#1.base| |c_ULTIMATE.start_main_~nondetArea~0#1.base|)) (= |c_ULTIMATE.start_main_~nondetString~0#1.offset| 0) (<= |c_ULTIMATE.start_main_~i~0#1| 2)) is different from false [2022-07-21 16:58:24,829 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_cstrncpy_~src#1.base| |c_ULTIMATE.start_cstrncpy_~dst#1.base|)) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (<= |ULTIMATE.start_main_~length~0#1| 3) (< 2 |ULTIMATE.start_main_~length~0#1|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~src#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~dst#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (= |c_ULTIMATE.start_cstrncpy_~dst#1.offset| 0) (= |c_ULTIMATE.start_cstrncpy_~src#1.offset| 0)) is different from false [2022-07-21 16:58:25,361 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 0) (not (= |c_ULTIMATE.start_cstrncpy_~d~0#1.base| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (= |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) 2) 0) (forall ((|v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| Int) (|v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| Int) (v_ArrVal_353 Int) (v_ArrVal_351 Int)) (or (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45| (store (store (select |c_#memory_int| |v_ULTIMATE.start_cstrncpy_~d~0#1.base_45|) |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| v_ArrVal_351) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39| v_ArrVal_353)) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0) (< (+ |c_ULTIMATE.start_cstrncpy_~d~0#1.offset| 1) |v_ULTIMATE.start_cstrncpy_#t~post3#1.offset_39|))) (exists ((|ULTIMATE.start_main_~length~0#1| Int)) (and (<= |ULTIMATE.start_main_~length~0#1| 3) (= (select (select |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ (- 1) |ULTIMATE.start_main_~length~0#1|)) 0) (< 2 |ULTIMATE.start_main_~length~0#1|)))) is different from false [2022-07-21 16:58:25,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:25,579 INFO L93 Difference]: Finished difference Result 78 states and 81 transitions. [2022-07-21 16:58:25,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 16:58:25,580 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-21 16:58:25,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:25,580 INFO L225 Difference]: With dead ends: 78 [2022-07-21 16:58:25,581 INFO L226 Difference]: Without dead ends: 59 [2022-07-21 16:58:25,581 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=217, Invalid=2340, Unknown=17, NotChecked=618, Total=3192 [2022-07-21 16:58:25,582 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 44 mSDsluCounter, 331 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 193 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:25,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 346 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 249 Invalid, 0 Unknown, 193 Unchecked, 0.1s Time] [2022-07-21 16:58:25,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-21 16:58:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2022-07-21 16:58:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0925925925925926) internal successors, (59), 55 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:25,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 59 transitions. [2022-07-21 16:58:25,583 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 59 transitions. Word has length 37 [2022-07-21 16:58:25,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:25,584 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 59 transitions. [2022-07-21 16:58:25,584 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.0476190476190474) internal successors, (86), 42 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:25,584 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 59 transitions. [2022-07-21 16:58:25,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-07-21 16:58:25,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:25,584 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:25,601 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-21 16:58:25,791 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-21 16:58:25,792 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:25,792 INFO L85 PathProgramCache]: Analyzing trace with hash 207254747, now seen corresponding path program 4 times [2022-07-21 16:58:25,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:25,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657964807] [2022-07-21 16:58:25,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:25,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:25,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:25,931 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-21 16:58:25,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657964807] [2022-07-21 16:58:25,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657964807] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:25,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [373716854] [2022-07-21 16:58:25,931 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:58:25,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:25,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:25,940 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-21 16:58:25,941 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-21 16:58:26,045 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:58:26,045 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:26,047 INFO L263 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-21 16:58:26,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:26,061 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:26,062 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-21 16:58:26,329 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-21 16:58:26,330 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:26,649 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-21 16:58:26,649 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [373716854] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:26,649 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:26,649 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 34 [2022-07-21 16:58:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574582909] [2022-07-21 16:58:26,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:26,650 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-21 16:58:26,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:26,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-21 16:58:26,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1054, Unknown=0, NotChecked=0, Total=1190 [2022-07-21 16:58:26,651 INFO L87 Difference]: Start difference. First operand 56 states and 59 transitions. Second operand has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:27,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:27,221 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2022-07-21 16:58:27,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 16:58:27,222 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2022-07-21 16:58:27,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:27,222 INFO L225 Difference]: With dead ends: 56 [2022-07-21 16:58:27,222 INFO L226 Difference]: Without dead ends: 56 [2022-07-21 16:58:27,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 342 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=417, Invalid=1839, Unknown=0, NotChecked=0, Total=2256 [2022-07-21 16:58:27,223 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 193 mSDsluCounter, 199 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 456 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:27,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 217 Invalid, 456 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:58:27,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-07-21 16:58:27,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-07-21 16:58:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.0740740740740742) internal successors, (58), 55 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 58 transitions. [2022-07-21 16:58:27,224 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 58 transitions. Word has length 41 [2022-07-21 16:58:27,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:27,225 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 58 transitions. [2022-07-21 16:58:27,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 3.3823529411764706) internal successors, (115), 35 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 58 transitions. [2022-07-21 16:58:27,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-07-21 16:58:27,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:27,225 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:27,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:27,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-21 16:58:27,435 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:27,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:27,436 INFO L85 PathProgramCache]: Analyzing trace with hash 1595560281, now seen corresponding path program 5 times [2022-07-21 16:58:27,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:27,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073578059] [2022-07-21 16:58:27,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:27,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:27,791 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-21 16:58:27,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:27,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073578059] [2022-07-21 16:58:27,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073578059] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:27,794 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [547079031] [2022-07-21 16:58:27,794 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:58:27,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:27,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:27,795 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-21 16:58:27,809 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-21 16:58:27,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-07-21 16:58:27,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:27,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 291 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-21 16:58:27,955 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:27,959 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-21 16:58:28,101 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-21 16:58:28,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:58:28,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:28,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:58:28,340 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-21 16:58:28,343 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-21 16:58:28,343 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:28,354 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:58:28,358 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:28,367 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_441 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_441) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:28,371 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:28,378 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_440 (Array Int Int)) (v_ArrVal_442 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_440) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:28,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:28,385 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_442) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:58:28,389 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_442 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_442) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 3 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:28,393 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:28,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:28,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:28,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:58:28,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:28,573 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-21 16:58:28,573 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [547079031] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:28,573 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:28,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 19] total 43 [2022-07-21 16:58:28,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167218079] [2022-07-21 16:58:28,573 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:28,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-21 16:58:28,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:28,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-21 16:58:28,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=1095, Unknown=8, NotChecked=584, Total=1806 [2022-07-21 16:58:28,575 INFO L87 Difference]: Start difference. First operand 56 states and 58 transitions. Second operand has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:29,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:29,083 INFO L93 Difference]: Finished difference Result 88 states and 90 transitions. [2022-07-21 16:58:29,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:58:29,083 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 47 [2022-07-21 16:58:29,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:29,084 INFO L225 Difference]: With dead ends: 88 [2022-07-21 16:58:29,084 INFO L226 Difference]: Without dead ends: 63 [2022-07-21 16:58:29,084 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 68 SyntacticMatches, 12 SemanticMatches, 49 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=178, Invalid=1652, Unknown=8, NotChecked=712, Total=2550 [2022-07-21 16:58:29,085 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 280 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:29,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 475 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 403 Invalid, 0 Unknown, 280 Unchecked, 0.2s Time] [2022-07-21 16:58:29,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-21 16:58:29,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2022-07-21 16:58:29,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0689655172413792) internal successors, (62), 59 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:29,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2022-07-21 16:58:29,086 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 47 [2022-07-21 16:58:29,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:29,087 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2022-07-21 16:58:29,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.2093023255813953) internal successors, (95), 43 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:29,087 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2022-07-21 16:58:29,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-07-21 16:58:29,087 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:29,087 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:29,107 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-21 16:58:29,299 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-21 16:58:29,300 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:29,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:29,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1297179492, now seen corresponding path program 6 times [2022-07-21 16:58:29,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:29,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857930042] [2022-07-21 16:58:29,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:29,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:29,466 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-21 16:58:29,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:29,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857930042] [2022-07-21 16:58:29,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857930042] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:29,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952483360] [2022-07-21 16:58:29,466 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:58:29,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:29,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:29,468 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-21 16:58:29,469 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-21 16:58:29,578 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-07-21 16:58:29,578 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:29,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-21 16:58:29,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:29,592 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:29,593 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-21 16:58:29,843 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-21 16:58:29,844 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:30,207 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 28 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:30,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952483360] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:30,207 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:30,207 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 35 [2022-07-21 16:58:30,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372192401] [2022-07-21 16:58:30,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:30,208 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-21 16:58:30,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:30,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-21 16:58:30,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 16:58:30,209 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:30,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:30,655 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-07-21 16:58:30,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 16:58:30,656 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 51 [2022-07-21 16:58:30,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:30,656 INFO L225 Difference]: With dead ends: 61 [2022-07-21 16:58:30,656 INFO L226 Difference]: Without dead ends: 61 [2022-07-21 16:58:30,657 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 79 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 414 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=460, Invalid=1892, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 16:58:30,657 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 221 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:30,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 263 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-21 16:58:30,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-21 16:58:30,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2022-07-21 16:58:30,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 58 states have (on average 1.0517241379310345) internal successors, (61), 59 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:30,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2022-07-21 16:58:30,659 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 51 [2022-07-21 16:58:30,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:30,659 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2022-07-21 16:58:30,659 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 3.942857142857143) internal successors, (138), 36 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:30,660 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2022-07-21 16:58:30,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-07-21 16:58:30,660 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:30,660 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:30,677 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-21 16:58:30,867 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-21 16:58:30,868 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:30,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:30,868 INFO L85 PathProgramCache]: Analyzing trace with hash -351804326, now seen corresponding path program 7 times [2022-07-21 16:58:30,868 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:30,868 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345307573] [2022-07-21 16:58:30,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:30,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:30,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:31,276 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-21 16:58:31,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345307573] [2022-07-21 16:58:31,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345307573] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:31,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1893212088] [2022-07-21 16:58:31,276 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:58:31,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:31,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:31,277 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-21 16:58:31,278 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-21 16:58:31,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:31,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 100 conjunts are in the unsatisfiable core [2022-07-21 16:58:31,367 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:31,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 10 treesize of output 8 [2022-07-21 16:58:31,551 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-21 16:58:31,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:58:31,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:31,853 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:31,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-21 16:58:31,876 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-21 16:58:31,878 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-21 16:58:31,878 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:31,887 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:58:31,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:31,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int)) (v_ArrVal_547 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:31,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:31,917 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:31,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:31,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_545 (Array Int Int)) (v_ArrVal_548 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_545) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:31,944 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:31,948 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_548) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:31,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_548 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_548) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:31,956 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:31,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:31,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:31,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 37 treesize of output 37 [2022-07-21 16:58:31,965 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:32,136 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-21 16:58:32,136 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1893212088] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:32,136 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:32,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 22, 22] total 51 [2022-07-21 16:58:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658356375] [2022-07-21 16:58:32,137 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:32,137 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-21 16:58:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:32,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-21 16:58:32,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=1529, Unknown=10, NotChecked=870, Total=2550 [2022-07-21 16:58:32,138 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:32,841 INFO L93 Difference]: Finished difference Result 98 states and 99 transitions. [2022-07-21 16:58:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-21 16:58:32,842 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2022-07-21 16:58:32,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:32,842 INFO L225 Difference]: With dead ends: 98 [2022-07-21 16:58:32,842 INFO L226 Difference]: Without dead ends: 67 [2022-07-21 16:58:32,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 85 SyntacticMatches, 12 SemanticMatches, 60 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 575 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=213, Invalid=2469, Unknown=10, NotChecked=1090, Total=3782 [2022-07-21 16:58:32,844 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 37 mSDsluCounter, 588 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 520 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:32,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 611 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 690 Invalid, 0 Unknown, 520 Unchecked, 0.3s Time] [2022-07-21 16:58:32,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-21 16:58:32,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 64. [2022-07-21 16:58:32,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 63 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:32,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 65 transitions. [2022-07-21 16:58:32,846 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 65 transitions. Word has length 57 [2022-07-21 16:58:32,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:32,846 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 65 transitions. [2022-07-21 16:58:32,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.3137254901960786) internal successors, (118), 51 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:32,847 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 65 transitions. [2022-07-21 16:58:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 16:58:32,847 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:32,847 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:32,871 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-21 16:58:33,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-21 16:58:33,063 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:33,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:33,064 INFO L85 PathProgramCache]: Analyzing trace with hash -841664547, now seen corresponding path program 8 times [2022-07-21 16:58:33,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:33,064 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777925867] [2022-07-21 16:58:33,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:33,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:33,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:33,274 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-21 16:58:33,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777925867] [2022-07-21 16:58:33,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777925867] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:33,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [85799507] [2022-07-21 16:58:33,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:58:33,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:33,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:33,276 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-21 16:58:33,310 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-21 16:58:33,385 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:58:33,385 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:33,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 355 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-21 16:58:33,389 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:33,629 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-21 16:58:33,629 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:33,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:58:33,939 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-21 16:58:33,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [85799507] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:33,939 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:33,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 36 [2022-07-21 16:58:33,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040313717] [2022-07-21 16:58:33,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:33,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-21 16:58:33,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-21 16:58:33,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1203, Unknown=0, NotChecked=0, Total=1332 [2022-07-21 16:58:33,941 INFO L87 Difference]: Start difference. First operand 64 states and 65 transitions. Second operand has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:34,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:34,668 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2022-07-21 16:58:34,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 16:58:34,668 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-07-21 16:58:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:34,669 INFO L225 Difference]: With dead ends: 72 [2022-07-21 16:58:34,669 INFO L226 Difference]: Without dead ends: 72 [2022-07-21 16:58:34,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 99 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 372 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=593, Invalid=2487, Unknown=0, NotChecked=0, Total=3080 [2022-07-21 16:58:34,670 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 554 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 613 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 330 SdHoareTripleChecker+Invalid, 705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 613 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:34,670 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 330 Invalid, 705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 613 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:58:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-07-21 16:58:34,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2022-07-21 16:58:34,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 67 states have (on average 1.044776119402985) internal successors, (70), 68 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:34,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2022-07-21 16:58:34,671 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 61 [2022-07-21 16:58:34,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:34,671 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2022-07-21 16:58:34,671 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 3.4166666666666665) internal successors, (123), 37 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:34,671 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-07-21 16:58:34,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 16:58:34,672 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:34,672 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:34,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-21 16:58:34,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:34,872 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:34,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:34,872 INFO L85 PathProgramCache]: Analyzing trace with hash -321797194, now seen corresponding path program 3 times [2022-07-21 16:58:34,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:34,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [468491800] [2022-07-21 16:58:34,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:34,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:35,193 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 26 proven. 49 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 16:58:35,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [468491800] [2022-07-21 16:58:35,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [468491800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:35,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723717970] [2022-07-21 16:58:35,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:58:35,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:35,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:35,194 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-21 16:58:35,195 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-21 16:58:35,365 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2022-07-21 16:58:35,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:35,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 119 conjunts are in the unsatisfiable core [2022-07-21 16:58:35,375 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:35,384 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:35,384 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-21 16:58:35,390 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-21 16:58:35,960 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 16:58:35,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:36,807 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-07-21 16:58:36,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723717970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:36,807 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:36,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 17, 17] total 51 [2022-07-21 16:58:36,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775834849] [2022-07-21 16:58:36,807 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:36,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-07-21 16:58:36,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:36,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-07-21 16:58:36,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2375, Unknown=0, NotChecked=0, Total=2652 [2022-07-21 16:58:36,809 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:38,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:38,204 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-21 16:58:38,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:58:38,204 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-21 16:58:38,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:38,205 INFO L225 Difference]: With dead ends: 70 [2022-07-21 16:58:38,205 INFO L226 Difference]: Without dead ends: 70 [2022-07-21 16:58:38,206 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1677 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=764, Invalid=5556, Unknown=0, NotChecked=0, Total=6320 [2022-07-21 16:58:38,206 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 113 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 789 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:38,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 259 Invalid, 789 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:58:38,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-21 16:58:38,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 68. [2022-07-21 16:58:38,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 67 states have (on average 1.0298507462686568) internal successors, (69), 67 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:38,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 69 transitions. [2022-07-21 16:58:38,208 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 69 transitions. Word has length 62 [2022-07-21 16:58:38,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:38,208 INFO L495 AbstractCegarLoop]: Abstraction has 68 states and 69 transitions. [2022-07-21 16:58:38,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 51 states have (on average 2.549019607843137) internal successors, (130), 52 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:38,208 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 69 transitions. [2022-07-21 16:58:38,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 16:58:38,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:38,208 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:38,213 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-07-21 16:58:38,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:38,413 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:38,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:38,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1711491803, now seen corresponding path program 9 times [2022-07-21 16:58:38,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:38,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927353954] [2022-07-21 16:58:38,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:38,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:38,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:38,923 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-21 16:58:38,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927353954] [2022-07-21 16:58:38,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927353954] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:38,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2021520123] [2022-07-21 16:58:38,924 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:58:38,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:38,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:38,925 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-21 16:58:38,926 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-21 16:58:39,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2022-07-21 16:58:39,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:39,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 391 conjuncts, 155 conjunts are in the unsatisfiable core [2022-07-21 16:58:39,126 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:39,133 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-21 16:58:39,418 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-21 16:58:39,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:39,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:39,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:40,048 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:40,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:40,299 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:58:40,301 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:40,301 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-21 16:58:40,303 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-21 16:58:40,304 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:40,313 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:58:40,324 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:40,332 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_726 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_726) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:40,337 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_725 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_725) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 16:58:40,350 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_724 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_724) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,372 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:40,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_723 (Array Int Int)) (v_ArrVal_727 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_723) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:40,386 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,390 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_727) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,396 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_727 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_727) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:40,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:40,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:40,404 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:40,404 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:58:40,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:40,719 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-21 16:58:40,719 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2021520123] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:40,719 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:40,719 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 25, 25] total 72 [2022-07-21 16:58:40,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455405250] [2022-07-21 16:58:40,720 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:40,720 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-21 16:58:40,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:40,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-21 16:58:40,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=3357, Unknown=12, NotChecked=1524, Total=5112 [2022-07-21 16:58:40,722 INFO L87 Difference]: Start difference. First operand 68 states and 69 transitions. Second operand has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:41,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:41,675 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2022-07-21 16:58:41,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-21 16:58:41,675 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-07-21 16:58:41,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:41,676 INFO L225 Difference]: With dead ends: 112 [2022-07-21 16:58:41,676 INFO L226 Difference]: Without dead ends: 75 [2022-07-21 16:58:41,677 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 92 SyntacticMatches, 5 SemanticMatches, 87 ConstructedPredicates, 12 IntricatePredicates, 6 DeprecatedPredicates, 1627 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=346, Invalid=5542, Unknown=12, NotChecked=1932, Total=7832 [2022-07-21 16:58:41,677 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 29 mSDsluCounter, 796 mSDsCounter, 0 mSdLazyCounter, 493 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 822 SdHoareTripleChecker+Invalid, 1111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 493 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 610 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:41,677 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 822 Invalid, 1111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 493 Invalid, 0 Unknown, 610 Unchecked, 0.2s Time] [2022-07-21 16:58:41,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-21 16:58:41,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2022-07-21 16:58:41,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 71 states have (on average 1.028169014084507) internal successors, (73), 71 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2022-07-21 16:58:41,679 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 67 [2022-07-21 16:58:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:41,679 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2022-07-21 16:58:41,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 2.4444444444444446) internal successors, (176), 72 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2022-07-21 16:58:41,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 16:58:41,679 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:41,680 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:41,700 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-21 16:58:41,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:41,888 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:41,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:41,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1133270686, now seen corresponding path program 10 times [2022-07-21 16:58:41,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:41,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420855938] [2022-07-21 16:58:41,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:41,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:42,157 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-21 16:58:42,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:42,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420855938] [2022-07-21 16:58:42,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420855938] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:42,158 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1115002457] [2022-07-21 16:58:42,158 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:58:42,158 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:42,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:42,159 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-21 16:58:42,160 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-21 16:58:42,402 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:58:42,403 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:42,405 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-21 16:58:42,407 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:42,680 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-21 16:58:42,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:42,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:58:43,029 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-21 16:58:43,029 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1115002457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:43,029 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:43,029 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 41 [2022-07-21 16:58:43,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260954629] [2022-07-21 16:58:43,030 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:43,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-21 16:58:43,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:43,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-21 16:58:43,031 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1542, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 16:58:43,031 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:43,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:43,685 INFO L93 Difference]: Finished difference Result 80 states and 81 transitions. [2022-07-21 16:58:43,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-21 16:58:43,685 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2022-07-21 16:58:43,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:43,686 INFO L225 Difference]: With dead ends: 80 [2022-07-21 16:58:43,686 INFO L226 Difference]: Without dead ends: 80 [2022-07-21 16:58:43,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=655, Invalid=2767, Unknown=0, NotChecked=0, Total=3422 [2022-07-21 16:58:43,690 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 294 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:43,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 397 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 16:58:43,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-21 16:58:43,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2022-07-21 16:58:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.025974025974026) internal successors, (79), 77 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:43,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-07-21 16:58:43,692 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 71 [2022-07-21 16:58:43,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:43,692 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-07-21 16:58:43,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 3.4878048780487805) internal successors, (143), 42 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:43,692 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-07-21 16:58:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 16:58:43,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:43,693 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:43,711 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-21 16:58:43,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-07-21 16:58:43,901 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:43,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:43,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1392415964, now seen corresponding path program 11 times [2022-07-21 16:58:43,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:43,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57805314] [2022-07-21 16:58:43,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:43,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:44,601 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-21 16:58:44,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:44,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57805314] [2022-07-21 16:58:44,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57805314] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:44,602 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1714601614] [2022-07-21 16:58:44,602 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:58:44,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:44,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:44,603 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-21 16:58:44,603 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-21 16:58:45,126 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2022-07-21 16:58:45,126 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:45,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 441 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-21 16:58:45,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:45,157 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:58:45,157 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-21 16:58:45,166 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-21 16:58:45,476 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-21 16:58:45,684 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:45,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:45,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:46,093 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:46,242 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:46,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:46,528 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:46,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-21 16:58:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 45 proven. 161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:46,673 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:48,012 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:48,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:48,020 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:48,020 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:58:48,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 66 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:58:48,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1714601614] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:48,653 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:48,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 27, 27] total 86 [2022-07-21 16:58:48,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679650309] [2022-07-21 16:58:48,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:48,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 86 states [2022-07-21 16:58:48,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:48,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2022-07-21 16:58:48,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=6862, Unknown=5, NotChecked=0, Total=7310 [2022-07-21 16:58:48,656 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:50,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:50,941 INFO L93 Difference]: Finished difference Result 134 states and 135 transitions. [2022-07-21 16:58:50,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-07-21 16:58:50,943 INFO L78 Accepts]: Start accepts. Automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 77 [2022-07-21 16:58:50,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:50,944 INFO L225 Difference]: With dead ends: 134 [2022-07-21 16:58:50,944 INFO L226 Difference]: Without dead ends: 91 [2022-07-21 16:58:50,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2550 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=1102, Invalid=14895, Unknown=5, NotChecked=0, Total=16002 [2022-07-21 16:58:50,945 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 208 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 1039 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 383 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:50,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 1039 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 490 Invalid, 0 Unknown, 383 Unchecked, 0.2s Time] [2022-07-21 16:58:50,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-07-21 16:58:50,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 88. [2022-07-21 16:58:50,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.0229885057471264) internal successors, (89), 87 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:50,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2022-07-21 16:58:50,947 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 77 [2022-07-21 16:58:50,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:50,947 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2022-07-21 16:58:50,947 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 86 states, 86 states have (on average 2.5930232558139537) internal successors, (223), 86 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:50,947 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2022-07-21 16:58:50,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-07-21 16:58:50,948 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:50,948 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:50,969 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-21 16:58:51,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:51,163 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:51,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:51,164 INFO L85 PathProgramCache]: Analyzing trace with hash -2138844579, now seen corresponding path program 12 times [2022-07-21 16:58:51,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:51,164 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270550754] [2022-07-21 16:58:51,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:51,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:51,933 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-21 16:58:51,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270550754] [2022-07-21 16:58:51,933 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270550754] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:51,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273364956] [2022-07-21 16:58:51,933 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:58:51,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:51,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:51,934 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-21 16:58:51,935 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-21 16:58:52,272 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-07-21 16:58:52,272 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:58:52,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-21 16:58:52,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:52,287 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-21 16:58:52,721 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-21 16:58:52,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,059 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,205 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:58:53,947 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:58:53,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:53,949 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-21 16:58:53,951 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-21 16:58:53,951 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:53,961 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-21 16:58:53,966 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:53,973 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int)) (v_ArrVal_950 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_950) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:58:53,977 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:53,985 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_949 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_949) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:53,990 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:53,997 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_948 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_948) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,004 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:54,011 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_947 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_947) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:58:54,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_946 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_946) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,051 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_945 (Array Int Int)) (v_ArrVal_951 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_945) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,071 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_951) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,078 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_951 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_951) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 7 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:58:54,081 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:54,081 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:58:54,085 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:58:54,086 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:58:54,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:58:54,554 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-21 16:58:54,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273364956] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:54,555 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:54,555 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 31, 31] total 92 [2022-07-21 16:58:54,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894404325] [2022-07-21 16:58:54,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:54,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 92 states [2022-07-21 16:58:54,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:54,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2022-07-21 16:58:54,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=5469, Unknown=16, NotChecked=2608, Total=8372 [2022-07-21 16:58:54,556 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:56,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:56,237 INFO L93 Difference]: Finished difference Result 144 states and 145 transitions. [2022-07-21 16:58:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-07-21 16:58:56,238 INFO L78 Accepts]: Start accepts. Automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 87 [2022-07-21 16:58:56,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:56,238 INFO L225 Difference]: With dead ends: 144 [2022-07-21 16:58:56,238 INFO L226 Difference]: Without dead ends: 95 [2022-07-21 16:58:56,239 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 16 IntricatePredicates, 11 DeprecatedPredicates, 2833 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=487, Invalid=10481, Unknown=16, NotChecked=3536, Total=14520 [2022-07-21 16:58:56,240 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 43 mSDsluCounter, 1465 mSDsCounter, 0 mSdLazyCounter, 1066 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 1499 SdHoareTripleChecker+Invalid, 2473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1393 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:56,240 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 1499 Invalid, 2473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1066 Invalid, 0 Unknown, 1393 Unchecked, 0.4s Time] [2022-07-21 16:58:56,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-21 16:58:56,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2022-07-21 16:58:56,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.021978021978022) internal successors, (93), 91 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:56,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 93 transitions. [2022-07-21 16:58:56,241 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 93 transitions. Word has length 87 [2022-07-21 16:58:56,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:56,241 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 93 transitions. [2022-07-21 16:58:56,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 92 states, 92 states have (on average 2.5652173913043477) internal successors, (236), 92 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 93 transitions. [2022-07-21 16:58:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 16:58:56,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:56,242 INFO L195 NwaCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:56,264 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-21 16:58:56,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:56,451 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:56,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:56,452 INFO L85 PathProgramCache]: Analyzing trace with hash 1788632736, now seen corresponding path program 13 times [2022-07-21 16:58:56,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:56,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214960837] [2022-07-21 16:58:56,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:56,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:56,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:56,762 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-21 16:58:56,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:58:56,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214960837] [2022-07-21 16:58:56,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214960837] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:58:56,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896697690] [2022-07-21 16:58:56,763 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:58:56,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:56,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:58:56,764 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-21 16:58:56,768 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-21 16:58:56,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:58:56,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 505 conjuncts, 90 conjunts are in the unsatisfiable core [2022-07-21 16:58:56,885 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:58:57,233 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-21 16:58:57,234 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:58:57,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:58:57,721 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-21 16:58:57,722 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896697690] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:58:57,722 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:58:57,722 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 23, 23] total 48 [2022-07-21 16:58:57,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098697956] [2022-07-21 16:58:57,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:58:57,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-07-21 16:58:57,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:58:57,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-07-21 16:58:57,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=2139, Unknown=0, NotChecked=0, Total=2352 [2022-07-21 16:58:57,723 INFO L87 Difference]: Start difference. First operand 92 states and 93 transitions. Second operand has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:58,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:58:58,891 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-21 16:58:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-21 16:58:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 91 [2022-07-21 16:58:58,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:58:58,892 INFO L225 Difference]: With dead ends: 100 [2022-07-21 16:58:58,893 INFO L226 Difference]: Without dead ends: 100 [2022-07-21 16:58:58,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 153 SyntacticMatches, 2 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1130, Invalid=4722, Unknown=0, NotChecked=0, Total=5852 [2022-07-21 16:58:58,894 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 513 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1208 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 1307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 1208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:58:58,894 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 676 Invalid, 1307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 1208 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-21 16:58:58,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-21 16:58:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2022-07-21 16:58:58,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 97 states have (on average 1.0206185567010309) internal successors, (99), 97 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:58,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 99 transitions. [2022-07-21 16:58:58,896 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 99 transitions. Word has length 91 [2022-07-21 16:58:58,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:58:58,897 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 99 transitions. [2022-07-21 16:58:58,897 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 48 states have (on average 3.8125) internal successors, (183), 49 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:58:58,897 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 99 transitions. [2022-07-21 16:58:58,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 16:58:58,898 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:58:58,898 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:58:58,922 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-21 16:58:59,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:58:59,119 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:58:59,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:58:59,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1984621730, now seen corresponding path program 14 times [2022-07-21 16:58:59,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:58:59,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851497699] [2022-07-21 16:58:59,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:58:59,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:58:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:00,123 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-21 16:59:00,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851497699] [2022-07-21 16:59:00,123 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851497699] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:00,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [488575783] [2022-07-21 16:59:00,123 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:59:00,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:00,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:00,124 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-21 16:59:00,125 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-21 16:59:00,281 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:59:00,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:00,285 INFO L263 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 157 conjunts are in the unsatisfiable core [2022-07-21 16:59:00,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:00,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 16:59:00,625 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-21 16:59:00,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 16:59:01,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 16:59:01,253 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:59:01,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:59:01,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:59:01,809 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 16:59:01,997 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 16:59:02,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 16:59:02,361 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:02,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 16:59:02,553 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 263 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:02,553 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:04,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-21 16:59:04,263 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1123) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)))) is different from false [2022-07-21 16:59:04,273 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1123 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| Int)) (or (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205| 10) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1123) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_205|)) 0))) is different from false [2022-07-21 16:59:04,285 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:04,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:59:04,291 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:04,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:59:04,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 16:59:04,297 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:59:04,986 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 91 proven. 254 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-07-21 16:59:04,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [488575783] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:04,986 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:04,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 34, 34] total 108 [2022-07-21 16:59:04,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785355858] [2022-07-21 16:59:04,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:04,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 108 states [2022-07-21 16:59:04,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:04,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2022-07-21 16:59:04,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=660, Invalid=10263, Unknown=9, NotChecked=624, Total=11556 [2022-07-21 16:59:04,989 INFO L87 Difference]: Start difference. First operand 98 states and 99 transitions. Second operand has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:08,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:08,730 INFO L93 Difference]: Finished difference Result 168 states and 169 transitions. [2022-07-21 16:59:08,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2022-07-21 16:59:08,731 INFO L78 Accepts]: Start accepts. Automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-07-21 16:59:08,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:08,731 INFO L225 Difference]: With dead ends: 168 [2022-07-21 16:59:08,731 INFO L226 Difference]: Without dead ends: 113 [2022-07-21 16:59:08,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 148 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 4100 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=1415, Invalid=20050, Unknown=9, NotChecked=876, Total=22350 [2022-07-21 16:59:08,732 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 242 mSDsluCounter, 1630 mSDsCounter, 0 mSdLazyCounter, 905 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 1671 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 905 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 870 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:08,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 1671 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 905 Invalid, 0 Unknown, 870 Unchecked, 0.3s Time] [2022-07-21 16:59:08,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-21 16:59:08,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 108. [2022-07-21 16:59:08,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 107 states have (on average 1.0186915887850467) internal successors, (109), 107 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:08,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2022-07-21 16:59:08,735 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 97 [2022-07-21 16:59:08,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:08,735 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2022-07-21 16:59:08,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 108 states, 108 states have (on average 2.6203703703703702) internal successors, (283), 108 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:08,736 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2022-07-21 16:59:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 16:59:08,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:08,736 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:08,754 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-21 16:59:08,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-21 16:59:08,946 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:08,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:08,947 INFO L85 PathProgramCache]: Analyzing trace with hash -682858529, now seen corresponding path program 15 times [2022-07-21 16:59:08,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:08,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245411208] [2022-07-21 16:59:08,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:08,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:10,010 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:10,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:10,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245411208] [2022-07-21 16:59:10,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245411208] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:10,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530138481] [2022-07-21 16:59:10,011 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 16:59:10,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:10,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:10,012 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-21 16:59:10,012 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-21 16:59:11,591 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-21 16:59:11,592 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:11,602 INFO L263 TraceCheckSpWp]: Trace formula consists of 591 conjuncts, 229 conjunts are in the unsatisfiable core [2022-07-21 16:59:11,606 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:11,609 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-21 16:59:12,175 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-21 16:59:12,408 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:12,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:12,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:12,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:13,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:13,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:13,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-21 16:59:13,497 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:13,657 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:13,793 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:59:13,795 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:13,795 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-21 16:59:13,798 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 405 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:13,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:13,815 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|))) is different from false [2022-07-21 16:59:13,829 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:59:13,839 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1224 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1224) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:59:13,843 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1223) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,863 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1222 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1222) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,872 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)))) is different from false [2022-07-21 16:59:13,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1221 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1221) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:59:13,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,890 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int)) (v_ArrVal_1220 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1220) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,894 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,900 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1219 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1219) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 16:59:13,927 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1218 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1218) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,933 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:59:13,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1217 (Array Int Int)) (v_ArrVal_1225 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1217) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:59:13,946 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,950 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1225) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1225) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:13,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:13,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:59:13,962 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:13,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 37 treesize of output 37 [2022-07-21 16:59:13,964 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:59:14,568 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 38 proven. 154 refuted. 0 times theorem prover too weak. 0 trivial. 251 not checked. [2022-07-21 16:59:14,568 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530138481] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:14,568 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:14,569 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 37, 37] total 112 [2022-07-21 16:59:14,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577991653] [2022-07-21 16:59:14,569 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:14,569 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 112 states [2022-07-21 16:59:14,569 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:14,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2022-07-21 16:59:14,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=8093, Unknown=20, NotChecked=3980, Total=12432 [2022-07-21 16:59:14,571 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:16,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:16,792 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2022-07-21 16:59:16,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-21 16:59:16,792 INFO L78 Accepts]: Start accepts. Automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2022-07-21 16:59:16,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:16,793 INFO L225 Difference]: With dead ends: 176 [2022-07-21 16:59:16,793 INFO L226 Difference]: Without dead ends: 115 [2022-07-21 16:59:16,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 296 GetRequests, 148 SyntacticMatches, 6 SemanticMatches, 142 ConstructedPredicates, 20 IntricatePredicates, 13 DeprecatedPredicates, 4331 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=574, Invalid=14738, Unknown=20, NotChecked=5260, Total=20592 [2022-07-21 16:59:16,794 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 51 mSDsluCounter, 1917 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 1959 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1670 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:16,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 1959 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1105 Invalid, 0 Unknown, 1670 Unchecked, 0.4s Time] [2022-07-21 16:59:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-07-21 16:59:16,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 112. [2022-07-21 16:59:16,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 111 states have (on average 1.018018018018018) internal successors, (113), 111 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:16,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 113 transitions. [2022-07-21 16:59:16,797 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 113 transitions. Word has length 107 [2022-07-21 16:59:16,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:16,797 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 113 transitions. [2022-07-21 16:59:16,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 112 states, 112 states have (on average 2.642857142857143) internal successors, (296), 112 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:16,797 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 113 transitions. [2022-07-21 16:59:16,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 16:59:16,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:16,798 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:16,838 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-21 16:59:17,017 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-21 16:59:17,017 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:17,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:17,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1213254494, now seen corresponding path program 16 times [2022-07-21 16:59:17,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:17,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [702060191] [2022-07-21 16:59:17,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:17,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:17,453 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 120 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:17,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:17,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [702060191] [2022-07-21 16:59:17,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [702060191] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:17,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395408096] [2022-07-21 16:59:17,454 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 16:59:17,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:17,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:17,455 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-21 16:59:17,491 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-21 16:59:18,287 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 16:59:18,287 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:18,293 INFO L263 TraceCheckSpWp]: Trace formula consists of 605 conjuncts, 116 conjunts are in the unsatisfiable core [2022-07-21 16:59:18,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:18,310 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:59:18,311 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-21 16:59:19,059 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 153 proven. 327 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:19,059 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:20,068 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 190 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:20,068 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395408096] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:20,068 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:20,068 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 25, 25] total 72 [2022-07-21 16:59:20,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218392649] [2022-07-21 16:59:20,068 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:20,069 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 73 states [2022-07-21 16:59:20,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:20,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2022-07-21 16:59:20,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=613, Invalid=4643, Unknown=0, NotChecked=0, Total=5256 [2022-07-21 16:59:20,071 INFO L87 Difference]: Start difference. First operand 112 states and 113 transitions. Second operand has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:21,215 INFO L93 Difference]: Finished difference Result 120 states and 121 transitions. [2022-07-21 16:59:21,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-21 16:59:21,215 INFO L78 Accepts]: Start accepts. Automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 111 [2022-07-21 16:59:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:21,216 INFO L225 Difference]: With dead ends: 120 [2022-07-21 16:59:21,216 INFO L226 Difference]: Without dead ends: 120 [2022-07-21 16:59:21,217 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 175 SyntacticMatches, 1 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2490 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1756, Invalid=7750, Unknown=0, NotChecked=0, Total=9506 [2022-07-21 16:59:21,217 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 471 mSDsluCounter, 822 mSDsCounter, 0 mSdLazyCounter, 1506 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:21,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 868 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1506 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-21 16:59:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-07-21 16:59:21,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 118. [2022-07-21 16:59:21,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 117 states have (on average 1.017094017094017) internal successors, (119), 117 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:21,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 119 transitions. [2022-07-21 16:59:21,219 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 119 transitions. Word has length 111 [2022-07-21 16:59:21,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:21,219 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 119 transitions. [2022-07-21 16:59:21,219 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 73 states, 72 states have (on average 4.486111111111111) internal successors, (323), 73 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:21,220 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 119 transitions. [2022-07-21 16:59:21,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 16:59:21,220 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:21,220 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:21,240 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-21 16:59:21,420 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-07-21 16:59:21,421 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:21,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:21,421 INFO L85 PathProgramCache]: Analyzing trace with hash 547086304, now seen corresponding path program 17 times [2022-07-21 16:59:21,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:21,421 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172087403] [2022-07-21 16:59:21,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:21,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:21,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:22,716 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 42 proven. 500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:22,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172087403] [2022-07-21 16:59:22,717 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172087403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:22,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1408527176] [2022-07-21 16:59:22,717 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 16:59:22,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:22,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:22,718 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-21 16:59:22,718 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-21 16:59:25,927 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 12 check-sat command(s) [2022-07-21 16:59:25,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:25,949 INFO L263 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 193 conjunts are in the unsatisfiable core [2022-07-21 16:59:25,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:25,965 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-21 16:59:25,965 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-21 16:59:25,972 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-21 16:59:26,605 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-21 16:59:26,856 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,009 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,169 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,340 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,681 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:27,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:28,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:28,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:28,432 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:28,620 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:28,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-07-21 16:59:28,809 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 153 proven. 389 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:28,809 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:31,435 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:31,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:59:31,440 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:31,440 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:59:31,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:59:32,665 INFO L134 CoverageAnalysis]: Checked inductivity of 542 backedges. 190 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:32,665 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1408527176] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:32,665 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:32,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 39, 39] total 126 [2022-07-21 16:59:32,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980168446] [2022-07-21 16:59:32,666 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:32,666 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 126 states [2022-07-21 16:59:32,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:32,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2022-07-21 16:59:32,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=829, Invalid=14910, Unknown=11, NotChecked=0, Total=15750 [2022-07-21 16:59:32,667 INFO L87 Difference]: Start difference. First operand 118 states and 119 transitions. Second operand has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:37,149 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2022-07-21 16:59:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2022-07-21 16:59:37,149 INFO L78 Accepts]: Start accepts. Automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 117 [2022-07-21 16:59:37,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:37,150 INFO L225 Difference]: With dead ends: 200 [2022-07-21 16:59:37,150 INFO L226 Difference]: Without dead ends: 133 [2022-07-21 16:59:37,151 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5973 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=2064, Invalid=32707, Unknown=11, NotChecked=0, Total=34782 [2022-07-21 16:59:37,151 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 395 mSDsluCounter, 2564 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 2613 SdHoareTripleChecker+Invalid, 2027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 814 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:37,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 2613 Invalid, 2027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1200 Invalid, 0 Unknown, 814 Unchecked, 0.4s Time] [2022-07-21 16:59:37,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-21 16:59:37,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 128. [2022-07-21 16:59:37,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 127 states have (on average 1.015748031496063) internal successors, (129), 127 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:37,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 129 transitions. [2022-07-21 16:59:37,153 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 129 transitions. Word has length 117 [2022-07-21 16:59:37,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:37,154 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 129 transitions. [2022-07-21 16:59:37,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 126 states, 126 states have (on average 2.7222222222222223) internal successors, (343), 126 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:37,154 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 129 transitions. [2022-07-21 16:59:37,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 16:59:37,155 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:37,155 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:37,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-07-21 16:59:37,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:37,363 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:37,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:37,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1821215585, now seen corresponding path program 18 times [2022-07-21 16:59:37,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:37,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700223436] [2022-07-21 16:59:37,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:37,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:37,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:38,703 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:38,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:38,703 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700223436] [2022-07-21 16:59:38,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700223436] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:38,704 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462816355] [2022-07-21 16:59:38,704 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 16:59:38,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:38,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:38,705 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-21 16:59:38,705 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-21 16:59:41,621 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-07-21 16:59:41,622 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:41,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 691 conjuncts, 237 conjunts are in the unsatisfiable core [2022-07-21 16:59:41,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:41,653 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-21 16:59:42,385 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-21 16:59:42,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:42,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:42,963 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,111 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,264 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,583 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:43,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:44,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:44,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:44,359 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 16:59:44,360 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:44,360 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-21 16:59:44,363 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 605 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:44,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:44,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 16:59:44,387 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:59:44,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1555 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1555) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 16:59:44,407 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 16:59:44,415 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1554 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1554) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,427 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1553 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1553) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,431 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:59:44,438 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1552 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1552) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 16:59:44,442 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,450 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1551 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1551) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 16:59:44,455 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,462 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int)) (v_ArrVal_1550 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1550) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,466 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,473 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1549 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1549) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:59:44,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1548) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 16:59:44,489 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1547 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1547) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 16:59:44,501 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:59:44,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1546 (Array Int Int)) (v_ArrVal_1556 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1546) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 16:59:44,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:59:44,515 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1556) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 11)) 0)) is different from false [2022-07-21 16:59:44,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1556 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 11)) 0)) is different from false [2022-07-21 16:59:44,523 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:44,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 16:59:44,527 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:44,528 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 16:59:44,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 16:59:45,341 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 46 proven. 232 refuted. 0 times theorem prover too weak. 0 trivial. 373 not checked. [2022-07-21 16:59:45,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462816355] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:45,342 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:45,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 43, 43] total 132 [2022-07-21 16:59:45,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2127325254] [2022-07-21 16:59:45,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:45,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 132 states [2022-07-21 16:59:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:45,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2022-07-21 16:59:45,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=11229, Unknown=24, NotChecked=5640, Total=17292 [2022-07-21 16:59:45,346 INFO L87 Difference]: Start difference. First operand 128 states and 129 transitions. Second operand has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:48,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:48,490 INFO L93 Difference]: Finished difference Result 208 states and 209 transitions. [2022-07-21 16:59:48,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-07-21 16:59:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 127 [2022-07-21 16:59:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:48,491 INFO L225 Difference]: With dead ends: 208 [2022-07-21 16:59:48,491 INFO L226 Difference]: Without dead ends: 135 [2022-07-21 16:59:48,493 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 183 SyntacticMatches, 3 SemanticMatches, 172 ConstructedPredicates, 24 IntricatePredicates, 13 DeprecatedPredicates, 6147 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=697, Invalid=21725, Unknown=24, NotChecked=7656, Total=30102 [2022-07-21 16:59:48,493 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 57 mSDsluCounter, 3046 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 3096 SdHoareTripleChecker+Invalid, 5359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2969 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:48,493 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 3096 Invalid, 5359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2369 Invalid, 0 Unknown, 2969 Unchecked, 0.8s Time] [2022-07-21 16:59:48,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-21 16:59:48,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2022-07-21 16:59:48,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 131 states have (on average 1.015267175572519) internal successors, (133), 131 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:48,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2022-07-21 16:59:48,495 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 127 [2022-07-21 16:59:48,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:48,495 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2022-07-21 16:59:48,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 132 states, 132 states have (on average 2.696969696969697) internal successors, (356), 132 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:48,496 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2022-07-21 16:59:48,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-07-21 16:59:48,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:48,496 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:48,508 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-21 16:59:48,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:48,707 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:48,707 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:48,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1005234012, now seen corresponding path program 19 times [2022-07-21 16:59:48,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:48,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598125756] [2022-07-21 16:59:48,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:48,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:49,197 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 190 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:49,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:49,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598125756] [2022-07-21 16:59:49,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598125756] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:49,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588691574] [2022-07-21 16:59:49,198 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 16:59:49,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:49,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:49,199 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-21 16:59:49,199 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-21 16:59:49,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:49,364 INFO L263 TraceCheckSpWp]: Trace formula consists of 705 conjuncts, 126 conjunts are in the unsatisfiable core [2022-07-21 16:59:49,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:49,943 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:49,943 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 16:59:50,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 16:59:50,696 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 231 proven. 465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:50,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588691574] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 16:59:50,697 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 16:59:50,697 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 31] total 64 [2022-07-21 16:59:50,697 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910469213] [2022-07-21 16:59:50,697 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 16:59:50,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-07-21 16:59:50,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 16:59:50,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-07-21 16:59:50,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=3793, Unknown=0, NotChecked=0, Total=4160 [2022-07-21 16:59:50,698 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:52,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 16:59:52,657 INFO L93 Difference]: Finished difference Result 140 states and 141 transitions. [2022-07-21 16:59:52,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-21 16:59:52,657 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 131 [2022-07-21 16:59:52,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 16:59:52,657 INFO L225 Difference]: With dead ends: 140 [2022-07-21 16:59:52,657 INFO L226 Difference]: Without dead ends: 140 [2022-07-21 16:59:52,658 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 225 SyntacticMatches, 2 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1492 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2126, Invalid=8794, Unknown=0, NotChecked=0, Total=10920 [2022-07-21 16:59:52,658 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 773 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 1953 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 773 SdHoareTripleChecker+Valid, 1119 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 1953 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 16:59:52,658 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [773 Valid, 1119 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 1953 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-21 16:59:52,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-07-21 16:59:52,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2022-07-21 16:59:52,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 137 states have (on average 1.0145985401459854) internal successors, (139), 137 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:52,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2022-07-21 16:59:52,676 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 131 [2022-07-21 16:59:52,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 16:59:52,677 INFO L495 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2022-07-21 16:59:52,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 64 states have (on average 4.109375) internal successors, (263), 65 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 16:59:52,677 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2022-07-21 16:59:52,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 16:59:52,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 16:59:52,678 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 16:59:52,696 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-21 16:59:52,887 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-21 16:59:52,887 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 16:59:52,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 16:59:52,888 INFO L85 PathProgramCache]: Analyzing trace with hash -1834780062, now seen corresponding path program 20 times [2022-07-21 16:59:52,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 16:59:52,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439531418] [2022-07-21 16:59:52,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 16:59:52,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 16:59:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 16:59:54,385 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 50 proven. 720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 16:59:54,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439531418] [2022-07-21 16:59:54,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439531418] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 16:59:54,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426924133] [2022-07-21 16:59:54,386 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 16:59:54,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 16:59:54,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 16:59:54,387 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-21 16:59:54,387 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-21 16:59:54,565 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 16:59:54,565 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 16:59:54,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 741 conjuncts, 219 conjunts are in the unsatisfiable core [2022-07-21 16:59:54,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 16:59:54,577 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-21 16:59:55,223 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-21 16:59:55,524 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:55,676 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:55,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:55,998 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:56,165 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:56,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:56,496 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:56,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:56,841 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:57,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:57,200 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:57,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 16:59:57,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 16:59:57,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2022-07-21 16:59:57,767 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 16:59:57,767 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:00:00,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-21 17:00:00,997 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:00,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 17:00:01,002 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:01,002 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 17:00:01,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:00:02,403 INFO L134 CoverageAnalysis]: Checked inductivity of 770 backedges. 231 proven. 539 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:02,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426924133] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:00:02,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:00:02,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 46, 46] total 148 [2022-07-21 17:00:02,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119906922] [2022-07-21 17:00:02,404 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:00:02,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 148 states [2022-07-21 17:00:02,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:00:02,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2022-07-21 17:00:02,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1230, Invalid=20517, Unknown=9, NotChecked=0, Total=21756 [2022-07-21 17:00:02,406 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:07,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:00:07,361 INFO L93 Difference]: Finished difference Result 232 states and 233 transitions. [2022-07-21 17:00:07,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-07-21 17:00:07,361 INFO L78 Accepts]: Start accepts. Automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 137 [2022-07-21 17:00:07,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:00:07,362 INFO L225 Difference]: With dead ends: 232 [2022-07-21 17:00:07,362 INFO L226 Difference]: Without dead ends: 153 [2022-07-21 17:00:07,364 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 400 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8604 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=2555, Invalid=39666, Unknown=9, NotChecked=0, Total=42230 [2022-07-21 17:00:07,365 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 600 mSDsluCounter, 2495 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 2552 SdHoareTripleChecker+Invalid, 2726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1603 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-21 17:00:07,365 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 2552 Invalid, 2726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1105 Invalid, 0 Unknown, 1603 Unchecked, 0.4s Time] [2022-07-21 17:00:07,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-21 17:00:07,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2022-07-21 17:00:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 147 states have (on average 1.0136054421768708) internal successors, (149), 147 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 149 transitions. [2022-07-21 17:00:07,367 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 149 transitions. Word has length 137 [2022-07-21 17:00:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:00:07,368 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 149 transitions. [2022-07-21 17:00:07,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 148 states, 148 states have (on average 2.722972972972973) internal successors, (403), 148 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 149 transitions. [2022-07-21 17:00:07,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 17:00:07,369 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:00:07,369 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:00:07,401 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-07-21 17:00:07,583 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-07-21 17:00:07,583 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:00:07,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:00:07,584 INFO L85 PathProgramCache]: Analyzing trace with hash 1006091491, now seen corresponding path program 21 times [2022-07-21 17:00:07,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:00:07,584 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859290868] [2022-07-21 17:00:07,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:00:07,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:00:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:00:09,274 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:09,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:00:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859290868] [2022-07-21 17:00:09,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859290868] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:00:09,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1359408817] [2022-07-21 17:00:09,274 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-21 17:00:09,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:00:09,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:00:09,275 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:00:09,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-07-21 17:00:13,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2022-07-21 17:00:13,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:00:13,083 INFO L263 TraceCheckSpWp]: Trace formula consists of 791 conjuncts, 305 conjunts are in the unsatisfiable core [2022-07-21 17:00:13,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:00:13,093 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-21 17:00:14,036 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-21 17:00:14,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:14,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:14,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:14,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:15,065 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:15,258 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:15,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:15,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:15,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:16,037 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:16,252 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:16,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:16,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:00:16,806 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:00:16,807 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:16,807 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-21 17:00:16,811 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:16,811 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:00:16,820 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 17:00:16,825 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 17:00:16,831 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1932 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1932) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 17:00:16,836 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,845 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1931 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1931) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,850 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,857 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1930 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1930) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,862 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 17:00:16,868 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1929 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1929) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 17:00:16,873 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,881 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1928) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,885 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,896 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1927 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1927) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,901 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)))) is different from false [2022-07-21 17:00:16,908 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1926) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,912 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 17:00:16,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1925 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1925) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 17:00:16,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,930 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1924) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,934 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 17:00:16,941 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1923 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1923) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 17:00:16,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-21 17:00:16,953 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1922 (Array Int Int)) (v_ArrVal_1933 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1922) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-21 17:00:16,958 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-21 17:00:16,964 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int)) (v_ArrVal_1921 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1921) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-21 17:00:16,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-21 17:00:16,972 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_1933) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src#1.offset| 13)) 0)) is different from false [2022-07-21 17:00:16,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1933 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1933) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 13 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 17:00:16,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:16,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 17:00:16,982 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:16,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 17:00:16,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:00:18,055 INFO L134 CoverageAnalysis]: Checked inductivity of 899 backedges. 54 proven. 326 refuted. 0 times theorem prover too weak. 0 trivial. 519 not checked. [2022-07-21 17:00:18,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1359408817] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:00:18,056 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:00:18,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 49, 49] total 152 [2022-07-21 17:00:18,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063423723] [2022-07-21 17:00:18,056 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:00:18,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 152 states [2022-07-21 17:00:18,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:00:18,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2022-07-21 17:00:18,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=459, Invalid=14877, Unknown=28, NotChecked=7588, Total=22952 [2022-07-21 17:00:18,058 INFO L87 Difference]: Start difference. First operand 148 states and 149 transitions. Second operand has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:21,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:00:21,965 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2022-07-21 17:00:21,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2022-07-21 17:00:21,965 INFO L78 Accepts]: Start accepts. Automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 147 [2022-07-21 17:00:21,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:00:21,966 INFO L225 Difference]: With dead ends: 240 [2022-07-21 17:00:21,966 INFO L226 Difference]: Without dead ends: 155 [2022-07-21 17:00:21,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 212 SyntacticMatches, 12 SemanticMatches, 190 ConstructedPredicates, 28 IntricatePredicates, 7 DeprecatedPredicates, 8047 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=735, Invalid=26081, Unknown=28, NotChecked=9828, Total=36672 [2022-07-21 17:00:21,968 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 62 mSDsluCounter, 3543 mSDsCounter, 0 mSdLazyCounter, 2570 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 3601 SdHoareTripleChecker+Invalid, 6490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 3896 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:00:21,968 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 3601 Invalid, 6490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2570 Invalid, 0 Unknown, 3896 Unchecked, 0.8s Time] [2022-07-21 17:00:21,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-21 17:00:21,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2022-07-21 17:00:21,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 151 states have (on average 1.0132450331125828) internal successors, (153), 151 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:21,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 153 transitions. [2022-07-21 17:00:21,970 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 153 transitions. Word has length 147 [2022-07-21 17:00:21,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:00:21,971 INFO L495 AbstractCegarLoop]: Abstraction has 152 states and 153 transitions. [2022-07-21 17:00:21,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 152 states, 152 states have (on average 2.736842105263158) internal successors, (416), 152 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:21,971 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 153 transitions. [2022-07-21 17:00:21,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 17:00:21,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:00:21,972 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:00:21,983 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-07-21 17:00:22,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:00:22,182 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:00:22,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:00:22,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1386171046, now seen corresponding path program 22 times [2022-07-21 17:00:22,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:00:22,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000883484] [2022-07-21 17:00:22,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:00:22,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:00:22,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:00:22,777 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 276 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:22,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:00:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000883484] [2022-07-21 17:00:22,777 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000883484] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:00:22,777 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270036102] [2022-07-21 17:00:22,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-21 17:00:22,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:00:22,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:00:22,779 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:00:22,807 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-07-21 17:00:23,928 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-21 17:00:23,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:00:23,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 149 conjunts are in the unsatisfiable core [2022-07-21 17:00:23,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:00:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:24,632 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:00:25,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2022-07-21 17:00:25,982 INFO L134 CoverageAnalysis]: Checked inductivity of 952 backedges. 325 proven. 627 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:25,982 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270036102] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:00:25,982 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:00:25,982 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 86 [2022-07-21 17:00:25,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528736561] [2022-07-21 17:00:25,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:00:25,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 87 states [2022-07-21 17:00:25,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:00:25,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2022-07-21 17:00:25,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=910, Invalid=6572, Unknown=0, NotChecked=0, Total=7482 [2022-07-21 17:00:25,984 INFO L87 Difference]: Start difference. First operand 152 states and 153 transitions. Second operand has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:27,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:00:27,620 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2022-07-21 17:00:27,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-07-21 17:00:27,620 INFO L78 Accepts]: Start accepts. Automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2022-07-21 17:00:27,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:00:27,621 INFO L225 Difference]: With dead ends: 160 [2022-07-21 17:00:27,621 INFO L226 Difference]: Without dead ends: 160 [2022-07-21 17:00:27,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 249 SyntacticMatches, 1 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3275 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=2988, Invalid=11292, Unknown=0, NotChecked=0, Total=14280 [2022-07-21 17:00:27,623 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 796 mSDsluCounter, 1350 mSDsCounter, 0 mSdLazyCounter, 2361 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 796 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 2519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 2361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-21 17:00:27,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [796 Valid, 1412 Invalid, 2519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 2361 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-07-21 17:00:27,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-07-21 17:00:27,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2022-07-21 17:00:27,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 157 states have (on average 1.0127388535031847) internal successors, (159), 157 states have internal predecessors, (159), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:27,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 159 transitions. [2022-07-21 17:00:27,625 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 159 transitions. Word has length 151 [2022-07-21 17:00:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:00:27,625 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 159 transitions. [2022-07-21 17:00:27,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 87 states, 86 states have (on average 4.1976744186046515) internal successors, (361), 87 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:00:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 159 transitions. [2022-07-21 17:00:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 17:00:27,626 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:00:27,626 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:00:27,657 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-07-21 17:00:27,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:00:27,843 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:00:27,843 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:00:27,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1681679076, now seen corresponding path program 23 times [2022-07-21 17:00:27,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:00:27,844 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776856117] [2022-07-21 17:00:27,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:00:27,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:00:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:00:29,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 58 proven. 980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:29,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:00:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776856117] [2022-07-21 17:00:29,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [776856117] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:00:29,770 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [798966238] [2022-07-21 17:00:29,770 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-21 17:00:29,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:00:29,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:00:29,771 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:00:29,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-07-21 17:00:48,916 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 16 check-sat command(s) [2022-07-21 17:00:48,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:00:48,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 841 conjuncts, 242 conjunts are in the unsatisfiable core [2022-07-21 17:00:48,951 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:00:48,956 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-21 17:00:48,963 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-21 17:00:49,993 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-21 17:00:50,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:00:50,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:50,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:51,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:51,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:51,662 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:51,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:52,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:52,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:52,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:53,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:53,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:53,574 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:00:53,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:00:54,119 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:54,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 20 [2022-07-21 17:00:54,430 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 325 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:00:54,430 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:00:58,576 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~s~0#1.base|)))) is different from false [2022-07-21 17:00:58,585 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (< |c_ULTIMATE.start_cstrncpy_~src#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2208) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0))) is different from false [2022-07-21 17:00:58,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2208 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2208) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_445|))) is different from false [2022-07-21 17:00:58,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:58,609 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 17:00:58,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:00:58,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 17:00:58,618 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:01:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 1038 backedges. 378 proven. 645 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-21 17:01:01,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [798966238] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:01:01,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:01:01,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 52, 52] total 168 [2022-07-21 17:01:01,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896642066] [2022-07-21 17:01:01,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:01:01,760 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 168 states [2022-07-21 17:01:01,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:01:01,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2022-07-21 17:01:01,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1298, Invalid=25753, Unknown=21, NotChecked=984, Total=28056 [2022-07-21 17:01:01,761 INFO L87 Difference]: Start difference. First operand 158 states and 159 transitions. Second operand has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:11,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:01:11,229 INFO L93 Difference]: Finished difference Result 264 states and 265 transitions. [2022-07-21 17:01:11,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2022-07-21 17:01:11,229 INFO L78 Accepts]: Start accepts. Automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 157 [2022-07-21 17:01:11,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:01:11,230 INFO L225 Difference]: With dead ends: 264 [2022-07-21 17:01:11,230 INFO L226 Difference]: Without dead ends: 173 [2022-07-21 17:01:11,232 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 487 GetRequests, 240 SyntacticMatches, 0 SemanticMatches, 247 ConstructedPredicates, 3 IntricatePredicates, 2 DeprecatedPredicates, 10599 ImplicationChecksByTransitivity, 20.2s TimeCoverageRelationStatistics Valid=3163, Invalid=57098, Unknown=21, NotChecked=1470, Total=61752 [2022-07-21 17:01:11,232 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 627 mSDsluCounter, 4139 mSDsCounter, 0 mSdLazyCounter, 2061 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 4204 SdHoareTripleChecker+Invalid, 4779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2061 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2699 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-21 17:01:11,233 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 4204 Invalid, 4779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2061 Invalid, 0 Unknown, 2699 Unchecked, 0.7s Time] [2022-07-21 17:01:11,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-21 17:01:11,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 168. [2022-07-21 17:01:11,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 167 states have (on average 1.0119760479041917) internal successors, (169), 167 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:11,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2022-07-21 17:01:11,235 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 157 [2022-07-21 17:01:11,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:01:11,235 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2022-07-21 17:01:11,235 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 168 states, 168 states have (on average 2.755952380952381) internal successors, (463), 168 states have internal predecessors, (463), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:11,235 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2022-07-21 17:01:11,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-21 17:01:11,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:01:11,236 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:01:11,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-07-21 17:01:11,452 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:01:11,452 INFO L420 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:01:11,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:01:11,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1522236517, now seen corresponding path program 24 times [2022-07-21 17:01:11,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:01:11,453 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459490229] [2022-07-21 17:01:11,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:01:11,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:01:11,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:01:13,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:13,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:01:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459490229] [2022-07-21 17:01:13,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459490229] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:01:13,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [86066723] [2022-07-21 17:01:13,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-21 17:01:13,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:01:13,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:01:13,559 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:01:13,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-07-21 17:01:38,911 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 17 check-sat command(s) [2022-07-21 17:01:38,911 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:01:38,961 INFO L263 TraceCheckSpWp]: Trace formula consists of 891 conjuncts, 347 conjunts are in the unsatisfiable core [2022-07-21 17:01:38,965 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:01:38,971 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-21 17:01:40,122 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-21 17:01:40,443 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:40,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:40,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:41,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:41,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:41,447 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:41,643 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:41,844 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:42,040 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:42,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:42,454 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:42,652 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:42,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:43,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:43,270 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-21 17:01:43,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-21 17:01:43,467 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:01:43,467 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-21 17:01:43,472 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 1125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:43,472 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:01:43,481 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|) 0)) is different from false [2022-07-21 17:01:43,485 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 17:01:43,492 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2363 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2363) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 1)) 0)) is different from false [2022-07-21 17:01:43,496 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2362 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2362) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,514 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2361 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2361) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,519 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 17:01:43,526 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2360 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2360) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 4)) 0)) is different from false [2022-07-21 17:01:43,531 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,538 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2359 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2359) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,543 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,550 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2358 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2358) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,555 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2357 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2357) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,567 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 17:01:43,573 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2356 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2356) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 8)) 0)) is different from false [2022-07-21 17:01:43,578 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2355 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2355) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,595 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 17:01:43,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2354 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2354) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 10)) 0)) is different from false [2022-07-21 17:01:43,610 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-21 17:01:43,616 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2353 (Array Int Int)) (v_ArrVal_2364 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2353) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 11)) 0)) is different from false [2022-07-21 17:01:43,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-21 17:01:43,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2352 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2352) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 12)) 0)) is different from false [2022-07-21 17:01:43,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-21 17:01:43,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2351 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2351) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 13)) 0)) is different from false [2022-07-21 17:01:43,643 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,649 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int)) (v_ArrVal_2350 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2350) |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~s~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,653 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~d~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~s~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~s~0#1.offset| 15)) 0)) is different from false [2022-07-21 17:01:43,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst#1.base| v_ArrVal_2364) |c_ULTIMATE.start_cstrncpy_~src#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,659 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2364 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2364) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 15 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-21 17:01:43,663 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:01:43,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-21 17:01:43,670 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-21 17:01:43,670 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-21 17:01:43,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-21 17:01:44,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1187 backedges. 62 proven. 436 refuted. 0 times theorem prover too weak. 0 trivial. 689 not checked. [2022-07-21 17:01:44,949 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [86066723] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:01:44,949 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:01:44,949 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [70, 55, 55] total 172 [2022-07-21 17:01:44,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785946790] [2022-07-21 17:01:44,950 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:01:44,950 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 172 states [2022-07-21 17:01:44,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:01:44,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2022-07-21 17:01:44,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=519, Invalid=19037, Unknown=32, NotChecked=9824, Total=29412 [2022-07-21 17:01:44,952 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:49,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:01:49,518 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2022-07-21 17:01:49,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2022-07-21 17:01:49,519 INFO L78 Accepts]: Start accepts. Automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 167 [2022-07-21 17:01:49,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:01:49,519 INFO L225 Difference]: With dead ends: 272 [2022-07-21 17:01:49,519 INFO L226 Difference]: Without dead ends: 175 [2022-07-21 17:01:49,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 467 GetRequests, 238 SyntacticMatches, 24 SemanticMatches, 205 ConstructedPredicates, 32 IntricatePredicates, 1 DeprecatedPredicates, 10185 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=755, Invalid=29791, Unknown=32, NotChecked=12064, Total=42642 [2022-07-21 17:01:49,521 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 68 mSDsluCounter, 4513 mSDsCounter, 0 mSdLazyCounter, 3219 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 4579 SdHoareTripleChecker+Invalid, 8302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 3219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 5062 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-21 17:01:49,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 4579 Invalid, 8302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 3219 Invalid, 0 Unknown, 5062 Unchecked, 1.0s Time] [2022-07-21 17:01:49,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-07-21 17:01:49,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 172. [2022-07-21 17:01:49,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 171 states have (on average 1.0116959064327486) internal successors, (173), 171 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:49,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 173 transitions. [2022-07-21 17:01:49,523 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 173 transitions. Word has length 167 [2022-07-21 17:01:49,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:01:49,523 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 173 transitions. [2022-07-21 17:01:49,524 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 172 states, 172 states have (on average 2.7674418604651163) internal successors, (476), 172 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:49,524 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 173 transitions. [2022-07-21 17:01:49,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 17:01:49,525 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:01:49,525 INFO L195 NwaCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:01:49,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-07-21 17:01:49,743 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-07-21 17:01:49,744 INFO L420 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:01:49,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:01:49,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1872595624, now seen corresponding path program 25 times [2022-07-21 17:01:49,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:01:49,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022057403] [2022-07-21 17:01:49,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:01:49,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:01:49,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:01:50,458 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 378 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:50,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:01:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022057403] [2022-07-21 17:01:50,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022057403] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:01:50,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482847899] [2022-07-21 17:01:50,458 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-21 17:01:50,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:01:50,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:01:50,460 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:01:50,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-07-21 17:01:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:01:50,681 INFO L263 TraceCheckSpWp]: Trace formula consists of 905 conjuncts, 162 conjunts are in the unsatisfiable core [2022-07-21 17:01:50,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:01:51,434 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:51,434 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 17:01:52,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-21 17:01:52,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1248 backedges. 435 proven. 813 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:52,456 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482847899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 17:01:52,456 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 17:01:52,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 39, 39] total 81 [2022-07-21 17:01:52,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843219275] [2022-07-21 17:01:52,457 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 17:01:52,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 82 states [2022-07-21 17:01:52,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 17:01:52,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2022-07-21 17:01:52,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=710, Invalid=5932, Unknown=0, NotChecked=0, Total=6642 [2022-07-21 17:01:52,464 INFO L87 Difference]: Start difference. First operand 172 states and 173 transitions. Second operand has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:54,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 17:01:54,666 INFO L93 Difference]: Finished difference Result 180 states and 181 transitions. [2022-07-21 17:01:54,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-07-21 17:01:54,667 INFO L78 Accepts]: Start accepts. Automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 171 [2022-07-21 17:01:54,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 17:01:54,674 INFO L225 Difference]: With dead ends: 180 [2022-07-21 17:01:54,674 INFO L226 Difference]: Without dead ends: 180 [2022-07-21 17:01:54,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 297 SyntacticMatches, 2 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3022 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2675, Invalid=11367, Unknown=0, NotChecked=0, Total=14042 [2022-07-21 17:01:54,675 INFO L413 NwaCegarLoop]: 70 mSDtfsCounter, 1074 mSDsluCounter, 1877 mSDsCounter, 0 mSdLazyCounter, 3430 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1074 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 3642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 3430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-07-21 17:01:54,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1074 Valid, 1947 Invalid, 3642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 3430 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2022-07-21 17:01:54,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-07-21 17:01:54,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2022-07-21 17:01:54,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 177 states have (on average 1.0112994350282485) internal successors, (179), 177 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:54,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 179 transitions. [2022-07-21 17:01:54,676 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 179 transitions. Word has length 171 [2022-07-21 17:01:54,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 17:01:54,677 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 179 transitions. [2022-07-21 17:01:54,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 82 states, 81 states have (on average 4.234567901234568) internal successors, (343), 82 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-21 17:01:54,677 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 179 transitions. [2022-07-21 17:01:54,677 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 17:01:54,677 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 17:01:54,677 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 17:01:54,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-07-21 17:01:54,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-07-21 17:01:54,886 INFO L420 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-21 17:01:54,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 17:01:54,887 INFO L85 PathProgramCache]: Analyzing trace with hash 1129781606, now seen corresponding path program 26 times [2022-07-21 17:01:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 17:01:54,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410359313] [2022-07-21 17:01:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 17:01:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 17:01:54,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 17:01:57,200 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 66 proven. 1280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-21 17:01:57,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 17:01:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410359313] [2022-07-21 17:01:57,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410359313] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 17:01:57,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685356973] [2022-07-21 17:01:57,201 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-21 17:01:57,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 17:01:57,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 17:01:57,202 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 17:01:57,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-07-21 17:01:57,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-21 17:01:57,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-21 17:01:57,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 941 conjuncts, 269 conjunts are in the unsatisfiable core [2022-07-21 17:01:57,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 17:01:57,473 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-21 17:01:58,376 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-21 17:01:58,781 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:01:58,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:01:59,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:01:59,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:01:59,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:01:59,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:02:00,144 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:02:00,390 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-21 17:02:00,628 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-21 17:02:00,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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