./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 18:17:57,942 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 18:17:57,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 18:17:57,972 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 18:17:57,973 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 18:17:57,974 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 18:17:57,975 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 18:17:57,976 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 18:17:57,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 18:17:57,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 18:17:57,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 18:17:57,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 18:17:57,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 18:17:57,982 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 18:17:57,982 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 18:17:57,983 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 18:17:57,984 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 18:17:57,985 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 18:17:57,986 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 18:17:57,988 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 18:17:57,989 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 18:17:57,990 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 18:17:57,991 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 18:17:57,992 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 18:17:57,993 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 18:17:57,996 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 18:17:57,996 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 18:17:57,996 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 18:17:57,997 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 18:17:57,997 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 18:17:57,998 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 18:17:57,998 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 18:17:58,006 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 18:17:58,007 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 18:17:58,008 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 18:17:58,009 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 18:17:58,010 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 18:17:58,011 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 18:17:58,011 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 18:17:58,011 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 18:17:58,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 18:17:58,014 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 18:17:58,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-12 18:17:58,039 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 18:17:58,040 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 18:17:58,040 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 18:17:58,040 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 18:17:58,041 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 18:17:58,041 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 18:17:58,042 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 18:17:58,042 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 18:17:58,042 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 18:17:58,043 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 18:17:58,043 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-12 18:17:58,044 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-12 18:17:58,044 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 18:17:58,044 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-12 18:17:58,044 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 18:17:58,044 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-12 18:17:58,045 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-12 18:17:58,045 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-12 18:17:58,045 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 18:17:58,046 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-12 18:17:58,046 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-12 18:17:58,046 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 18:17:58,047 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 18:17:58,047 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 18:17:58,047 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 18:17:58,047 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:17:58,048 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 18:17:58,048 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 18:17:58,048 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 18:17:58,048 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 18:17:58,048 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8246e56f0c6a2a64017cfdd94b26580c43f90ed61973daa969baf2d0942f8a17 [2022-07-12 18:17:58,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 18:17:58,282 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 18:17:58,285 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 18:17:58,286 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 18:17:58,287 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 18:17:58,288 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-12 18:17:58,356 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d17cc19/22d7db897958432e8fd3dc8179503f24/FLAGa819b439e [2022-07-12 18:17:58,829 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 18:17:58,830 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety/cstrncpy-alloca-2.i [2022-07-12 18:17:58,850 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d17cc19/22d7db897958432e8fd3dc8179503f24/FLAGa819b439e [2022-07-12 18:17:59,320 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8d17cc19/22d7db897958432e8fd3dc8179503f24 [2022-07-12 18:17:59,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 18:17:59,324 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 18:17:59,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 18:17:59,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 18:17:59,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 18:17:59,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d7b7e3a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59, skipping insertion in model container [2022-07-12 18:17:59,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 18:17:59,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 18:17:59,650 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:17:59,658 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 18:17:59,695 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 18:17:59,713 INFO L208 MainTranslator]: Completed translation [2022-07-12 18:17:59,714 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59 WrapperNode [2022-07-12 18:17:59,714 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 18:17:59,715 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 18:17:59,715 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 18:17:59,715 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 18:17:59,721 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,730 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,755 INFO L137 Inliner]: procedures = 117, calls = 14, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 87 [2022-07-12 18:17:59,757 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 18:17:59,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 18:17:59,758 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 18:17:59,758 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 18:17:59,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 18:17:59,778 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 18:17:59,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 18:17:59,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 18:17:59,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (1/1) ... [2022-07-12 18:17:59,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 18:17:59,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:17:59,809 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-12 18:17:59,816 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-12 18:17:59,850 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 18:17:59,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 18:17:59,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 18:17:59,852 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 18:17:59,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 18:17:59,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 18:17:59,984 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 18:17:59,985 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 18:18:00,204 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 18:18:00,209 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 18:18:00,215 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-07-12 18:18:00,217 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:18:00 BoogieIcfgContainer [2022-07-12 18:18:00,218 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 18:18:00,219 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 18:18:00,221 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 18:18:00,223 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 18:18:00,224 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 06:17:59" (1/3) ... [2022-07-12 18:18:00,224 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d227ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:18:00, skipping insertion in model container [2022-07-12 18:18:00,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 06:17:59" (2/3) ... [2022-07-12 18:18:00,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d227ecf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 06:18:00, skipping insertion in model container [2022-07-12 18:18:00,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 06:18:00" (3/3) ... [2022-07-12 18:18:00,226 INFO L111 eAbstractionObserver]: Analyzing ICFG cstrncpy-alloca-2.i [2022-07-12 18:18:00,245 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 18:18:00,246 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2022-07-12 18:18:00,299 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 18:18:00,306 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@25005a96, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4b90cd11 [2022-07-12 18:18:00,307 INFO L358 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2022-07-12 18:18:00,311 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:18:00,319 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:00,319 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:00,320 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-12 18:18:00,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:00,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029043, now seen corresponding path program 1 times [2022-07-12 18:18:00,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:00,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351988878] [2022-07-12 18:18:00,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:00,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:00,519 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-12 18:18:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:00,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351988878] [2022-07-12 18:18:00,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351988878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:00,522 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:00,522 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-12 18:18:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498726804] [2022-07-12 18:18:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:00,526 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-12 18:18:00,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:00,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-12 18:18:00,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-12 18:18:00,550 INFO L87 Difference]: Start difference. First operand has 35 states, 23 states have (on average 1.8695652173913044) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:00,601 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2022-07-12 18:18:00,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-12 18:18:00,606 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-12 18:18:00,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:00,612 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:18:00,612 INFO L226 Difference]: Without dead ends: 31 [2022-07-12 18:18:00,615 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-12 18:18:00,618 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:00,619 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 31 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:00,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-07-12 18:18:00,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-07-12 18:18:00,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.6363636363636365) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-07-12 18:18:00,649 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 7 [2022-07-12 18:18:00,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:00,650 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-07-12 18:18:00,651 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-12 18:18:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-07-12 18:18:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:18:00,651 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:00,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:00,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 18:18:00,653 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-12 18:18:00,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:00,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029044, now seen corresponding path program 1 times [2022-07-12 18:18:00,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:00,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69700534] [2022-07-12 18:18:00,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:00,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:00,736 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-12 18:18:00,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:00,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69700534] [2022-07-12 18:18:00,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69700534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:00,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:00,738 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:18:00,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998786575] [2022-07-12 18:18:00,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:00,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:18:00,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:00,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:18:00,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:18:00,742 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:00,780 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2022-07-12 18:18:00,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:18:00,780 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-12 18:18:00,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:00,783 INFO L225 Difference]: With dead ends: 30 [2022-07-12 18:18:00,783 INFO L226 Difference]: Without dead ends: 30 [2022-07-12 18:18:00,786 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-12 18:18:00,788 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 57 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:00,789 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 25 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:00,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-12 18:18:00,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-12 18:18:00,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 22 states have (on average 1.5909090909090908) internal successors, (35), 29 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-07-12 18:18:00,795 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 7 [2022-07-12 18:18:00,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:00,796 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-07-12 18:18:00,796 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-12 18:18:00,796 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-07-12 18:18:00,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:18:00,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:00,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:00,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 18:18:00,799 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-12 18:18:00,806 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:00,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1805029097, now seen corresponding path program 1 times [2022-07-12 18:18:00,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:00,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831413] [2022-07-12 18:18:00,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:00,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:00,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:00,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:00,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:00,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831413] [2022-07-12 18:18:00,876 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:00,876 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:00,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:18:00,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310364703] [2022-07-12 18:18:00,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:00,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:18:00,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:00,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:18:00,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:18:00,879 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:00,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:00,909 INFO L93 Difference]: Finished difference Result 53 states and 61 transitions. [2022-07-12 18:18:00,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:18:00,909 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-12 18:18:00,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:00,912 INFO L225 Difference]: With dead ends: 53 [2022-07-12 18:18:00,912 INFO L226 Difference]: Without dead ends: 53 [2022-07-12 18:18:00,912 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-12 18:18:00,915 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 48 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:00,918 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 62 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:00,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-07-12 18:18:00,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 33. [2022-07-12 18:18:00,923 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-12 18:18:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-12 18:18:00,924 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 7 [2022-07-12 18:18:00,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:00,925 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-12 18:18:00,925 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-12 18:18:00,925 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-12 18:18:00,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-12 18:18:00,925 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:00,926 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:00,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 18:18:00,926 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-12 18:18:00,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:00,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1806876139, now seen corresponding path program 1 times [2022-07-12 18:18:00,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:00,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55464031] [2022-07-12 18:18:00,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:00,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:00,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:00,999 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-12 18:18:00,999 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:00,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55464031] [2022-07-12 18:18:01,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55464031] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:01,000 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:01,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:18:01,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573537624] [2022-07-12 18:18:01,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:01,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:18:01,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:01,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:18:01,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:18:01,002 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,050 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2022-07-12 18:18:01,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:18:01,051 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-12 18:18:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,052 INFO L225 Difference]: With dead ends: 57 [2022-07-12 18:18:01,052 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 18:18:01,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:18:01,058 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 81 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 43 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:01,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 18:18:01,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 35. [2022-07-12 18:18:01,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 34 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2022-07-12 18:18:01,067 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 7 [2022-07-12 18:18:01,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,068 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2022-07-12 18:18:01,068 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-12 18:18:01,069 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2022-07-12 18:18:01,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:18:01,069 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,069 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 18:18:01,070 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:01,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,071 INFO L85 PathProgramCache]: Analyzing trace with hash 629680341, now seen corresponding path program 1 times [2022-07-12 18:18:01,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,071 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067515955] [2022-07-12 18:18:01,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,153 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-12 18:18:01,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067515955] [2022-07-12 18:18:01,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067515955] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:01,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:01,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 18:18:01,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034526150] [2022-07-12 18:18:01,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:01,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:18:01,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:01,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:18:01,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:18:01,156 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,230 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2022-07-12 18:18:01,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:18:01,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:18:01,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,231 INFO L225 Difference]: With dead ends: 46 [2022-07-12 18:18:01,231 INFO L226 Difference]: Without dead ends: 46 [2022-07-12 18:18:01,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:18:01,234 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 126 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 66 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:01,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-12 18:18:01,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2022-07-12 18:18:01,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 36 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 46 transitions. [2022-07-12 18:18:01,242 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 46 transitions. Word has length 10 [2022-07-12 18:18:01,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,242 INFO L495 AbstractCegarLoop]: Abstraction has 37 states and 46 transitions. [2022-07-12 18:18:01,242 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,243 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 46 transitions. [2022-07-12 18:18:01,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-12 18:18:01,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,246 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,247 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 18:18:01,247 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:01,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,248 INFO L85 PathProgramCache]: Analyzing trace with hash 629680340, now seen corresponding path program 1 times [2022-07-12 18:18:01,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,248 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741697101] [2022-07-12 18:18:01,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,316 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-12 18:18:01,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741697101] [2022-07-12 18:18:01,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741697101] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:01,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:01,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:18:01,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323874236] [2022-07-12 18:18:01,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:01,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:18:01,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:01,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:18:01,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:18:01,319 INFO L87 Difference]: Start difference. First operand 37 states and 46 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,364 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-07-12 18:18:01,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:18:01,365 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-12 18:18:01,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,368 INFO L225 Difference]: With dead ends: 36 [2022-07-12 18:18:01,368 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 18:18:01,369 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:18:01,370 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 44 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,371 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 49 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:01,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 18:18:01,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-07-12 18:18:01,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-12 18:18:01,378 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 10 [2022-07-12 18:18:01,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,379 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-12 18:18:01,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,379 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-12 18:18:01,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:18:01,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,380 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,380 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 18:18:01,380 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:01,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745921, now seen corresponding path program 1 times [2022-07-12 18:18:01,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,381 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027356312] [2022-07-12 18:18:01,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,439 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-12 18:18:01,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027356312] [2022-07-12 18:18:01,440 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027356312] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:01,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:01,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:18:01,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183409585] [2022-07-12 18:18:01,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:01,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:18:01,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:01,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:18:01,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:18:01,441 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,480 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2022-07-12 18:18:01,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-12 18:18:01,481 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-12 18:18:01,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,481 INFO L225 Difference]: With dead ends: 35 [2022-07-12 18:18:01,481 INFO L226 Difference]: Without dead ends: 35 [2022-07-12 18:18:01,481 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:18:01,482 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 59 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,482 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 51 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:01,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-07-12 18:18:01,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2022-07-12 18:18:01,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 29 states have (on average 1.4827586206896552) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-07-12 18:18:01,485 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 11 [2022-07-12 18:18:01,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,485 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-07-12 18:18:01,485 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-12 18:18:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-07-12 18:18:01,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:18:01,486 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,486 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 18:18:01,487 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:01,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1954745920, now seen corresponding path program 1 times [2022-07-12 18:18:01,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489520535] [2022-07-12 18:18:01,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,554 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-12 18:18:01,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489520535] [2022-07-12 18:18:01,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489520535] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:01,555 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:01,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:18:01,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279975297] [2022-07-12 18:18:01,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:01,556 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:18:01,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:01,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:18:01,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:18:01,557 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:01,618 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2022-07-12 18:18:01,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:18:01,619 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-12 18:18:01,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:01,620 INFO L225 Difference]: With dead ends: 41 [2022-07-12 18:18:01,620 INFO L226 Difference]: Without dead ends: 41 [2022-07-12 18:18:01,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:18:01,621 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:01,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:01,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-12 18:18:01,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 36. [2022-07-12 18:18:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.4666666666666666) internal successors, (44), 35 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-07-12 18:18:01,633 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 11 [2022-07-12 18:18:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:01,634 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-07-12 18:18:01,634 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-12 18:18:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-07-12 18:18:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-12 18:18:01,635 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:01,635 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:01,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 18:18:01,635 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:01,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:01,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1226025170, now seen corresponding path program 1 times [2022-07-12 18:18:01,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:01,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030602338] [2022-07-12 18:18:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:01,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,728 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-12 18:18:01,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:01,728 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030602338] [2022-07-12 18:18:01,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030602338] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:01,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889479591] [2022-07-12 18:18:01,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:01,729 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:01,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:01,731 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-12 18:18:01,732 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-12 18:18:01,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:01,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 12 conjunts are in the unsatisfiable core [2022-07-12 18:18:01,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:01,889 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:18:01,889 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-12 18:18:01,936 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-12 18:18:01,936 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:02,079 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-12 18:18:02,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889479591] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:02,079 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:02,079 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 8 [2022-07-12 18:18:02,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473310472] [2022-07-12 18:18:02,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:02,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 18:18:02,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:02,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 18:18:02,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:18:02,082 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:02,218 INFO L93 Difference]: Finished difference Result 80 states and 95 transitions. [2022-07-12 18:18:02,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:18:02,218 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-07-12 18:18:02,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:02,220 INFO L225 Difference]: With dead ends: 80 [2022-07-12 18:18:02,220 INFO L226 Difference]: Without dead ends: 80 [2022-07-12 18:18:02,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:18:02,222 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 221 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:02,222 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [221 Valid, 138 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-12 18:18:02,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 33. [2022-07-12 18:18:02,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 32 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 40 transitions. [2022-07-12 18:18:02,227 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 40 transitions. Word has length 11 [2022-07-12 18:18:02,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:02,227 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 40 transitions. [2022-07-12 18:18:02,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,228 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 40 transitions. [2022-07-12 18:18:02,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-12 18:18:02,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:02,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:02,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-12 18:18:02,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:02,456 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:02,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:02,456 INFO L85 PathProgramCache]: Analyzing trace with hash -467610218, now seen corresponding path program 1 times [2022-07-12 18:18:02,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:02,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923518612] [2022-07-12 18:18:02,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:02,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:02,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:02,486 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-12 18:18:02,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:02,487 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923518612] [2022-07-12 18:18:02,487 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923518612] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:02,487 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:02,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-12 18:18:02,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258480202] [2022-07-12 18:18:02,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:02,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:18:02,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:02,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:18:02,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:18:02,489 INFO L87 Difference]: Start difference. First operand 33 states and 40 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:02,508 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2022-07-12 18:18:02,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:18:02,508 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-12 18:18:02,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:02,509 INFO L225 Difference]: With dead ends: 33 [2022-07-12 18:18:02,509 INFO L226 Difference]: Without dead ends: 33 [2022-07-12 18:18:02,509 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-12 18:18:02,510 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 23 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:02,510 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 59 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-12 18:18:02,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-07-12 18:18:02,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2022-07-12 18:18:02,512 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 12 [2022-07-12 18:18:02,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:02,512 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2022-07-12 18:18:02,512 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-12 18:18:02,512 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2022-07-12 18:18:02,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:18:02,513 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:02,513 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:02,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 18:18:02,514 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:02,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:02,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1625875758, now seen corresponding path program 1 times [2022-07-12 18:18:02,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:02,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149260248] [2022-07-12 18:18:02,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:02,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:02,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:02,546 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-12 18:18:02,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:02,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149260248] [2022-07-12 18:18:02,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149260248] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:02,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:02,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:18:02,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091384875] [2022-07-12 18:18:02,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:02,548 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-12 18:18:02,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:02,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-12 18:18:02,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-12 18:18:02,549 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:02,574 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-07-12 18:18:02,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-12 18:18:02,575 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:18:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:02,575 INFO L225 Difference]: With dead ends: 61 [2022-07-12 18:18:02,575 INFO L226 Difference]: Without dead ends: 61 [2022-07-12 18:18:02,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:18:02,576 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 53 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:02,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 81 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-07-12 18:18:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 47. [2022-07-12 18:18:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.3095238095238095) internal successors, (55), 46 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2022-07-12 18:18:02,579 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 14 [2022-07-12 18:18:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:02,579 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2022-07-12 18:18:02,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2022-07-12 18:18:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:18:02,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:02,580 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:02,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 18:18:02,580 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:02,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:02,581 INFO L85 PathProgramCache]: Analyzing trace with hash -1968026960, now seen corresponding path program 1 times [2022-07-12 18:18:02,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:02,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177534665] [2022-07-12 18:18:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:02,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:02,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:02,665 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-12 18:18:02,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:02,665 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177534665] [2022-07-12 18:18:02,666 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177534665] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:02,666 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:02,666 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:18:02,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427948487] [2022-07-12 18:18:02,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:02,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:18:02,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:02,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:18:02,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:18:02,667 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:02,752 INFO L93 Difference]: Finished difference Result 69 states and 77 transitions. [2022-07-12 18:18:02,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:18:02,752 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:18:02,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:02,753 INFO L225 Difference]: With dead ends: 69 [2022-07-12 18:18:02,753 INFO L226 Difference]: Without dead ends: 69 [2022-07-12 18:18:02,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-07-12 18:18:02,754 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 39 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:02,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 149 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:02,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-07-12 18:18:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 51. [2022-07-12 18:18:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 50 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 59 transitions. [2022-07-12 18:18:02,757 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 59 transitions. Word has length 14 [2022-07-12 18:18:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:02,757 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 59 transitions. [2022-07-12 18:18:02,757 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 59 transitions. [2022-07-12 18:18:02,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-12 18:18:02,758 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:02,758 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:02,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 18:18:02,759 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:02,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:02,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1709861522, now seen corresponding path program 1 times [2022-07-12 18:18:02,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:02,759 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275064279] [2022-07-12 18:18:02,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:02,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:02,855 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-12 18:18:02,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:02,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275064279] [2022-07-12 18:18:02,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275064279] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:02,856 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:02,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 18:18:02,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116052424] [2022-07-12 18:18:02,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:02,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 18:18:02,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:02,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 18:18:02,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 18:18:02,858 INFO L87 Difference]: Start difference. First operand 51 states and 59 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:03,089 INFO L93 Difference]: Finished difference Result 81 states and 91 transitions. [2022-07-12 18:18:03,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 18:18:03,089 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-12 18:18:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:03,091 INFO L225 Difference]: With dead ends: 81 [2022-07-12 18:18:03,091 INFO L226 Difference]: Without dead ends: 81 [2022-07-12 18:18:03,091 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-07-12 18:18:03,092 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 40 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:03,092 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 146 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:03,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-07-12 18:18:03,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 53. [2022-07-12 18:18:03,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 48 states have (on average 1.3125) internal successors, (63), 52 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2022-07-12 18:18:03,094 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 63 transitions. Word has length 14 [2022-07-12 18:18:03,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:03,094 INFO L495 AbstractCegarLoop]: Abstraction has 53 states and 63 transitions. [2022-07-12 18:18:03,095 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,095 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 63 transitions. [2022-07-12 18:18:03,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:18:03,095 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:03,095 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:03,095 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 18:18:03,096 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:03,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:03,096 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011067, now seen corresponding path program 1 times [2022-07-12 18:18:03,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:03,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978643264] [2022-07-12 18:18:03,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:03,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,129 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-12 18:18:03,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:03,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978643264] [2022-07-12 18:18:03,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978643264] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:03,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:03,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-12 18:18:03,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889827429] [2022-07-12 18:18:03,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:03,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 18:18:03,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:03,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 18:18:03,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 18:18:03,132 INFO L87 Difference]: Start difference. First operand 53 states and 63 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:03,191 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-07-12 18:18:03,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:18:03,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:18:03,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:03,193 INFO L225 Difference]: With dead ends: 54 [2022-07-12 18:18:03,193 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 18:18:03,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-12 18:18:03,194 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 22 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:03,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 79 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:03,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 18:18:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 52. [2022-07-12 18:18:03,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 62 transitions. [2022-07-12 18:18:03,196 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 62 transitions. Word has length 15 [2022-07-12 18:18:03,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:03,196 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 62 transitions. [2022-07-12 18:18:03,197 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,197 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 62 transitions. [2022-07-12 18:18:03,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:18:03,197 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:03,197 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:03,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 18:18:03,198 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:03,198 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:03,198 INFO L85 PathProgramCache]: Analyzing trace with hash -1138011066, now seen corresponding path program 1 times [2022-07-12 18:18:03,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:03,199 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560251439] [2022-07-12 18:18:03,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:03,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,281 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-12 18:18:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:03,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560251439] [2022-07-12 18:18:03,282 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560251439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:03,282 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:03,282 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-12 18:18:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267743459] [2022-07-12 18:18:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:03,283 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-12 18:18:03,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-12 18:18:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-12 18:18:03,284 INFO L87 Difference]: Start difference. First operand 52 states and 62 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:03,353 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2022-07-12 18:18:03,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 18:18:03,354 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:18:03,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:03,354 INFO L225 Difference]: With dead ends: 66 [2022-07-12 18:18:03,355 INFO L226 Difference]: Without dead ends: 66 [2022-07-12 18:18:03,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2022-07-12 18:18:03,355 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 19 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:03,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 147 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:03,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-07-12 18:18:03,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2022-07-12 18:18:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 58 states have (on average 1.2413793103448276) internal successors, (72), 61 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-07-12 18:18:03,358 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 15 [2022-07-12 18:18:03,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:03,358 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-07-12 18:18:03,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,359 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-07-12 18:18:03,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-12 18:18:03,359 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:03,359 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:03,359 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 18:18:03,360 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash -879845628, now seen corresponding path program 1 times [2022-07-12 18:18:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:03,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578806571] [2022-07-12 18:18:03,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,528 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-12 18:18:03,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:03,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578806571] [2022-07-12 18:18:03,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578806571] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:03,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:03,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 18:18:03,529 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143829873] [2022-07-12 18:18:03,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:03,530 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 18:18:03,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 18:18:03,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-07-12 18:18:03,530 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:03,716 INFO L93 Difference]: Finished difference Result 67 states and 79 transitions. [2022-07-12 18:18:03,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-12 18:18:03,717 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-12 18:18:03,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:03,717 INFO L225 Difference]: With dead ends: 67 [2022-07-12 18:18:03,717 INFO L226 Difference]: Without dead ends: 67 [2022-07-12 18:18:03,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2022-07-12 18:18:03,718 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 51 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:03,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 104 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:03,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-07-12 18:18:03,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-07-12 18:18:03,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 61 states have (on average 1.2459016393442623) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-07-12 18:18:03,720 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 15 [2022-07-12 18:18:03,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:03,721 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-07-12 18:18:03,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 10 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,721 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-07-12 18:18:03,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-12 18:18:03,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:03,721 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:03,721 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 18:18:03,722 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:03,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:03,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1587978612, now seen corresponding path program 1 times [2022-07-12 18:18:03,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:03,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451328371] [2022-07-12 18:18:03,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:03,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,762 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-12 18:18:03,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:03,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451328371] [2022-07-12 18:18:03,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451328371] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 18:18:03,763 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 18:18:03,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-12 18:18:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955126158] [2022-07-12 18:18:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 18:18:03,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-12 18:18:03,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:03,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-12 18:18:03,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-12 18:18:03,765 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:03,781 INFO L93 Difference]: Finished difference Result 64 states and 75 transitions. [2022-07-12 18:18:03,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-12 18:18:03,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-12 18:18:03,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:03,782 INFO L225 Difference]: With dead ends: 64 [2022-07-12 18:18:03,782 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:18:03,782 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-12 18:18:03,783 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:03,783 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 44 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-12 18:18:03,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:18:03,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-12 18:18:03,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 35 states have (on average 1.2) internal successors, (42), 37 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-07-12 18:18:03,785 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 17 [2022-07-12 18:18:03,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:03,785 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-07-12 18:18:03,785 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:03,786 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-07-12 18:18:03,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-12 18:18:03,786 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:03,786 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:03,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 18:18:03,787 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:03,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:03,787 INFO L85 PathProgramCache]: Analyzing trace with hash 980027851, now seen corresponding path program 1 times [2022-07-12 18:18:03,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:03,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262449101] [2022-07-12 18:18:03,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:03,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,884 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-12 18:18:03,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:03,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262449101] [2022-07-12 18:18:03,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262449101] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:03,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502288757] [2022-07-12 18:18:03,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:03,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:03,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:03,886 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-12 18:18:03,895 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-12 18:18:03,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:03,964 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-12 18:18:03,967 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:04,065 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-12 18:18:04,065 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:04,204 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-12 18:18:04,219 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-12 18:18:04,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502288757] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:04,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:04,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-07-12 18:18:04,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719418621] [2022-07-12 18:18:04,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:04,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-12 18:18:04,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:04,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-12 18:18:04,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=286, Unknown=0, NotChecked=0, Total=342 [2022-07-12 18:18:04,222 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:04,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:04,522 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-07-12 18:18:04,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-12 18:18:04,523 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-07-12 18:18:04,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:04,523 INFO L225 Difference]: With dead ends: 63 [2022-07-12 18:18:04,523 INFO L226 Difference]: Without dead ends: 63 [2022-07-12 18:18:04,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=138, Invalid=564, Unknown=0, NotChecked=0, Total=702 [2022-07-12 18:18:04,524 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 183 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:04,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 122 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:04,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-07-12 18:18:04,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-07-12 18:18:04,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 38 states have (on average 1.2105263157894737) internal successors, (46), 40 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:04,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2022-07-12 18:18:04,526 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 18 [2022-07-12 18:18:04,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:04,526 INFO L495 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2022-07-12 18:18:04,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0) internal successors, (36), 19 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:04,526 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2022-07-12 18:18:04,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:18:04,526 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:04,526 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:04,563 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-12 18:18:04,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-12 18:18:04,727 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-12 18:18:04,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:04,728 INFO L85 PathProgramCache]: Analyzing trace with hash 358816956, now seen corresponding path program 1 times [2022-07-12 18:18:04,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:04,728 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403741341] [2022-07-12 18:18:04,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:04,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:04,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:04,915 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-12 18:18:04,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403741341] [2022-07-12 18:18:04,916 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403741341] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:04,916 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30168030] [2022-07-12 18:18:04,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:04,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:04,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:04,918 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-12 18:18:04,919 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-12 18:18:04,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:04,986 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-12 18:18:04,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:05,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:18:05,020 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-12 18:18:05,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 18:18:05,345 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-12 18:18:05,345 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:05,742 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:18:05,758 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-12 18:18:05,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30168030] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:05,758 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:05,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 30 [2022-07-12 18:18:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715641268] [2022-07-12 18:18:05,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:05,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 18:18:05,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:05,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 18:18:05,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=848, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:18:05,760 INFO L87 Difference]: Start difference. First operand 41 states and 46 transitions. Second operand has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:07,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:07,227 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-07-12 18:18:07,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:18:07,228 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:18:07,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:07,228 INFO L225 Difference]: With dead ends: 53 [2022-07-12 18:18:07,228 INFO L226 Difference]: Without dead ends: 24 [2022-07-12 18:18:07,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 17 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=430, Invalid=2120, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:18:07,230 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 116 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:07,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 226 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:18:07,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-12 18:18:07,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-12 18:18:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:07,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2022-07-12 18:18:07,232 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 19 [2022-07-12 18:18:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:07,232 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2022-07-12 18:18:07,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 31 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:07,232 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2022-07-12 18:18:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-12 18:18:07,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:07,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:07,258 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-12 18:18:07,447 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:07,448 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:07,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:07,448 INFO L85 PathProgramCache]: Analyzing trace with hash 316092298, now seen corresponding path program 1 times [2022-07-12 18:18:07,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:07,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940486520] [2022-07-12 18:18:07,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:07,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:07,520 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-12 18:18:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940486520] [2022-07-12 18:18:07,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940486520] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:07,521 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516772086] [2022-07-12 18:18:07,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:07,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:07,522 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:07,523 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-12 18:18:07,533 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-12 18:18:07,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:07,595 INFO L263 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-12 18:18:07,596 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:07,616 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-12 18:18:07,617 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-12 18:18:07,620 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-12 18:18:07,771 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-12 18:18:07,771 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:07,959 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-12 18:18:07,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516772086] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:07,959 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:07,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 16 [2022-07-12 18:18:07,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482278940] [2022-07-12 18:18:07,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:07,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-07-12 18:18:07,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:07,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-07-12 18:18:07,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=216, Unknown=0, NotChecked=0, Total=272 [2022-07-12 18:18:07,961 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:08,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:08,116 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-07-12 18:18:08,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 18:18:08,117 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-07-12 18:18:08,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:08,117 INFO L225 Difference]: With dead ends: 25 [2022-07-12 18:18:08,117 INFO L226 Difference]: Without dead ends: 25 [2022-07-12 18:18:08,118 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2022-07-12 18:18:08,118 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 40 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:08,118 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 66 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:08,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-07-12 18:18:08,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-07-12 18:18:08,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:08,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-07-12 18:18:08,120 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-07-12 18:18:08,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:08,120 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-07-12 18:18:08,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.0625) internal successors, (49), 17 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:08,120 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-07-12 18:18:08,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-12 18:18:08,120 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:08,120 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:08,146 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-12 18:18:08,327 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:08,327 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:08,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:08,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2137348900, now seen corresponding path program 2 times [2022-07-12 18:18:08,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:08,328 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301024488] [2022-07-12 18:18:08,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:08,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:08,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:08,546 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:08,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:08,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301024488] [2022-07-12 18:18:08,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301024488] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:08,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1507180069] [2022-07-12 18:18:08,547 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:18:08,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:08,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:08,551 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-12 18:18:08,553 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-12 18:18:08,635 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:18:08,636 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:08,637 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 59 conjunts are in the unsatisfiable core [2022-07-12 18:18:08,640 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:08,646 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-12 18:18:08,699 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-12 18:18:08,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:18:09,022 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:09,022 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-12 18:18:09,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:09,139 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:09,420 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1))) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-12 18:18:09,440 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| Int) (v_ArrVal_243 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (<= (+ 3 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_243) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22| 1)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_22|)))) is different from false [2022-07-12 18:18:09,453 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:09,453 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-12 18:18:09,461 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:09,461 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-12 18:18:09,466 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-12 18:18:09,477 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-12 18:18:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-12 18:18:09,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1507180069] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:09,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:09,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 35 [2022-07-12 18:18:09,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644353093] [2022-07-12 18:18:09,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:09,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 18:18:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:09,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 18:18:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=952, Unknown=2, NotChecked=126, Total=1190 [2022-07-12 18:18:09,582 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:10,036 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2022-07-12 18:18:10,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:18:10,036 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-12 18:18:10,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:10,036 INFO L225 Difference]: With dead ends: 46 [2022-07-12 18:18:10,036 INFO L226 Difference]: Without dead ends: 36 [2022-07-12 18:18:10,037 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=1783, Unknown=2, NotChecked=174, Total=2162 [2022-07-12 18:18:10,038 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 32 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:10,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 122 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 186 Invalid, 0 Unknown, 100 Unchecked, 0.1s Time] [2022-07-12 18:18:10,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-07-12 18:18:10,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2022-07-12 18:18:10,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:10,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-07-12 18:18:10,039 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 22 [2022-07-12 18:18:10,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:10,040 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-07-12 18:18:10,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.6571428571428573) internal successors, (58), 35 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:10,040 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-07-12 18:18:10,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-12 18:18:10,040 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:10,040 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:10,057 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-12 18:18:10,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:10,243 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:10,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:10,243 INFO L85 PathProgramCache]: Analyzing trace with hash 269887706, now seen corresponding path program 3 times [2022-07-12 18:18:10,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:10,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212483999] [2022-07-12 18:18:10,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:10,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:10,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:10,508 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:10,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212483999] [2022-07-12 18:18:10,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212483999] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:10,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1580767710] [2022-07-12 18:18:10,508 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:18:10,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:10,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:10,510 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-12 18:18:10,516 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-12 18:18:10,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-12 18:18:10,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:10,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 75 conjunts are in the unsatisfiable core [2022-07-12 18:18:10,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:10,624 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-12 18:18:10,719 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:18:10,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:10,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 14 treesize of output 16 [2022-07-12 18:18:10,866 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-12 18:18:10,869 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:10,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:10,878 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:18:10,884 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:10,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int)) (v_ArrVal_282 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_282) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:10,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:10,902 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_283 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_283) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 2 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:10,910 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:10,910 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-12 18:18:10,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:10,917 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-12 18:18:10,919 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-12 18:18:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 6 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 18:18:11,076 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1580767710] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:11,076 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:11,076 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 15] total 34 [2022-07-12 18:18:11,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2013148190] [2022-07-12 18:18:11,076 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:11,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-12 18:18:11,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:11,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-12 18:18:11,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=727, Unknown=5, NotChecked=290, Total=1122 [2022-07-12 18:18:11,078 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:11,462 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2022-07-12 18:18:11,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-12 18:18:11,463 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-12 18:18:11,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:11,463 INFO L225 Difference]: With dead ends: 52 [2022-07-12 18:18:11,463 INFO L226 Difference]: Without dead ends: 38 [2022-07-12 18:18:11,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=142, Invalid=1063, Unknown=5, NotChecked=350, Total=1560 [2022-07-12 18:18:11,464 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 26 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 122 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:11,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 173 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 307 Invalid, 0 Unknown, 122 Unchecked, 0.2s Time] [2022-07-12 18:18:11,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-12 18:18:11,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2022-07-12 18:18:11,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:11,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-07-12 18:18:11,466 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-07-12 18:18:11,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:11,466 INFO L495 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-07-12 18:18:11,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 34 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-07-12 18:18:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-12 18:18:11,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:11,466 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:11,494 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-12 18:18:11,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:11,679 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-12 18:18:11,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:11,680 INFO L85 PathProgramCache]: Analyzing trace with hash -826784969, now seen corresponding path program 4 times [2022-07-12 18:18:11,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:11,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039105386] [2022-07-12 18:18:11,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:11,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:11,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:11,815 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:11,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039105386] [2022-07-12 18:18:11,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039105386] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:11,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789354253] [2022-07-12 18:18:11,816 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:18:11,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:11,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:11,817 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-12 18:18:11,827 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-12 18:18:11,895 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:18:11,895 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:11,897 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 84 conjunts are in the unsatisfiable core [2022-07-12 18:18:11,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:11,911 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-12 18:18:11,918 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-12 18:18:12,078 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:18:12,211 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:12,298 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:12,376 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:12,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:18:12,482 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 8 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:12,483 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:12,965 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:12,965 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-12 18:18:12,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:12,972 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:18:12,975 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-12 18:18:13,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 15 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:13,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [789354253] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:13,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:13,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 16, 16] total 41 [2022-07-12 18:18:13,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524933458] [2022-07-12 18:18:13,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:13,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-07-12 18:18:13,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:13,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-07-12 18:18:13,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1518, Unknown=2, NotChecked=0, Total=1722 [2022-07-12 18:18:13,282 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:14,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:14,296 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2022-07-12 18:18:14,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-12 18:18:14,297 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-12 18:18:14,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:14,297 INFO L225 Difference]: With dead ends: 43 [2022-07-12 18:18:14,297 INFO L226 Difference]: Without dead ends: 43 [2022-07-12 18:18:14,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 476 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=491, Invalid=2926, Unknown=5, NotChecked=0, Total=3422 [2022-07-12 18:18:14,298 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 58 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 348 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:14,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 172 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 348 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-07-12 18:18:14,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-07-12 18:18:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-07-12 18:18:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:14,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-07-12 18:18:14,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 34 [2022-07-12 18:18:14,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:14,300 INFO L495 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-07-12 18:18:14,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 2.292682926829268) internal successors, (94), 42 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:14,300 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-07-12 18:18:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-07-12 18:18:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:14,301 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:14,325 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-12 18:18:14,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:14,515 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:14,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:14,516 INFO L85 PathProgramCache]: Analyzing trace with hash 2031773033, now seen corresponding path program 5 times [2022-07-12 18:18:14,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:14,516 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594941689] [2022-07-12 18:18:14,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:14,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:14,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:14,650 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 39 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:14,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:14,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594941689] [2022-07-12 18:18:14,651 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594941689] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:14,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413951299] [2022-07-12 18:18:14,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:18:14,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:14,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:14,652 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-12 18:18:14,653 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-12 18:18:14,767 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-07-12 18:18:14,767 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:14,769 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-12 18:18:14,771 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:14,785 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:18:14,785 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-12 18:18:15,071 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:15,071 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 46 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:15,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413951299] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:15,292 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:15,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 31 [2022-07-12 18:18:15,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764946774] [2022-07-12 18:18:15,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:15,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-12 18:18:15,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:15,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-12 18:18:15,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=774, Unknown=0, NotChecked=0, Total=930 [2022-07-12 18:18:15,295 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:15,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:15,688 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2022-07-12 18:18:15,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 18:18:15,689 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 42 [2022-07-12 18:18:15,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:15,689 INFO L225 Difference]: With dead ends: 70 [2022-07-12 18:18:15,689 INFO L226 Difference]: Without dead ends: 50 [2022-07-12 18:18:15,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 66 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=348, Invalid=1374, Unknown=0, NotChecked=0, Total=1722 [2022-07-12 18:18:15,690 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 81 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:15,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 101 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-12 18:18:15,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-12 18:18:15,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 47. [2022-07-12 18:18:15,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:15,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-07-12 18:18:15,692 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-07-12 18:18:15,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:15,693 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-07-12 18:18:15,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 3.032258064516129) internal successors, (94), 31 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:15,693 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-07-12 18:18:15,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-07-12 18:18:15,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:15,693 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:15,711 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-12 18:18:15,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-12 18:18:15,899 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-12 18:18:15,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:15,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1224662086, now seen corresponding path program 6 times [2022-07-12 18:18:15,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:15,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561088049] [2022-07-12 18:18:15,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:15,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:16,363 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:16,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:16,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561088049] [2022-07-12 18:18:16,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561088049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:16,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588166501] [2022-07-12 18:18:16,363 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:18:16,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:16,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:16,365 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-12 18:18:16,365 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-12 18:18:16,475 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-07-12 18:18:16,475 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:16,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 18:18:16,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:16,489 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-12 18:18:16,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:18:16,796 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:16,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:16,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:16,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:18:16,989 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-12 18:18:16,992 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:16,993 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:17,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:18:17,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)))) is different from false [2022-07-12 18:18:17,014 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_434 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_434) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:17,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:17,027 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_433) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:17,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:17,038 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int)) (v_ArrVal_432 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_432) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:17,044 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:17,047 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_435 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_435) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 4)) 0)) is different from false [2022-07-12 18:18:17,051 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:17,051 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-12 18:18:17,059 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:17,059 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-12 18:18:17,062 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-12 18:18:17,300 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 10 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 39 not checked. [2022-07-12 18:18:17,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588166501] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:17,300 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:17,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 21, 21] total 50 [2022-07-12 18:18:17,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198547837] [2022-07-12 18:18:17,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:17,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-12 18:18:17,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:17,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-12 18:18:17,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1525, Unknown=9, NotChecked=774, Total=2450 [2022-07-12 18:18:17,302 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:18,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:18,085 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2022-07-12 18:18:18,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-12 18:18:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 46 [2022-07-12 18:18:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:18,088 INFO L225 Difference]: With dead ends: 76 [2022-07-12 18:18:18,088 INFO L226 Difference]: Without dead ends: 54 [2022-07-12 18:18:18,089 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 61 SyntacticMatches, 14 SemanticMatches, 59 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 675 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=215, Invalid=2464, Unknown=9, NotChecked=972, Total=3660 [2022-07-12 18:18:18,089 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 32 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 400 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:18,089 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 396 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 756 Invalid, 0 Unknown, 400 Unchecked, 0.3s Time] [2022-07-12 18:18:18,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-07-12 18:18:18,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2022-07-12 18:18:18,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:18,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-07-12 18:18:18,091 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-07-12 18:18:18,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:18,091 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-07-12 18:18:18,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 50 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:18,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-07-12 18:18:18,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-12 18:18:18,091 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:18,092 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:18,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-12 18:18:18,311 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-12 18:18:18,311 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-12 18:18:18,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:18,312 INFO L85 PathProgramCache]: Analyzing trace with hash 300063907, now seen corresponding path program 7 times [2022-07-12 18:18:18,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:18,312 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129602266] [2022-07-12 18:18:18,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:18,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:18,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 15 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:18,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129602266] [2022-07-12 18:18:18,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129602266] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:18,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [640104995] [2022-07-12 18:18:18,558 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:18:18,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:18,559 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-12 18:18:18,561 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-12 18:18:18,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:18,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 63 conjunts are in the unsatisfiable core [2022-07-12 18:18:18,665 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:18,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:19,173 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-12 18:18:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 28 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:19,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [640104995] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:19,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:19,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 34 [2022-07-12 18:18:19,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190485590] [2022-07-12 18:18:19,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:19,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-07-12 18:18:19,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:19,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-07-12 18:18:19,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1050, Unknown=0, NotChecked=0, Total=1190 [2022-07-12 18:18:19,219 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:19,682 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-07-12 18:18:19,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-12 18:18:19,682 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 50 [2022-07-12 18:18:19,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:19,682 INFO L225 Difference]: With dead ends: 57 [2022-07-12 18:18:19,682 INFO L226 Difference]: Without dead ends: 57 [2022-07-12 18:18:19,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 79 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 432 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=449, Invalid=1903, Unknown=0, NotChecked=0, Total=2352 [2022-07-12 18:18:19,684 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 134 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:19,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 192 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:18:19,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-07-12 18:18:19,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-07-12 18:18:19,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-07-12 18:18:19,686 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-07-12 18:18:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:19,686 INFO L495 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-07-12 18:18:19,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.9411764705882355) internal successors, (100), 35 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:19,686 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-07-12 18:18:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-07-12 18:18:19,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:19,686 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:19,704 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-12 18:18:19,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-12 18:18:19,899 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-12 18:18:19,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:19,900 INFO L85 PathProgramCache]: Analyzing trace with hash -265764356, now seen corresponding path program 8 times [2022-07-12 18:18:19,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:19,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178073390] [2022-07-12 18:18:19,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:19,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:19,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:20,426 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 12 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:20,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:20,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178073390] [2022-07-12 18:18:20,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178073390] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:20,427 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827065512] [2022-07-12 18:18:20,427 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:18:20,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:20,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:20,428 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-12 18:18:20,428 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-12 18:18:20,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:18:20,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:20,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 381 conjuncts, 115 conjunts are in the unsatisfiable core [2022-07-12 18:18:20,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:20,539 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-12 18:18:20,722 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-12 18:18:20,937 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:21,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:21,249 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:21,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:21,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:21,749 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:21,749 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-12 18:18:21,888 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 89 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:21,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:22,855 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-12 18:18:22,871 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_556 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88| Int)) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (<= (+ 7 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_556) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 5 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_88|)))) is different from false [2022-07-12 18:18:22,882 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:22,882 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-12 18:18:22,891 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:22,891 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:18:22,896 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:18:22,900 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-12 18:18:23,294 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 28 proven. 83 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-12 18:18:23,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827065512] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:23,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:23,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 24, 24] total 75 [2022-07-12 18:18:23,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186371640] [2022-07-12 18:18:23,295 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:23,295 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 18:18:23,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:23,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 18:18:23,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=367, Invalid=4890, Unknown=7, NotChecked=286, Total=5550 [2022-07-12 18:18:23,297 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:25,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:25,552 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2022-07-12 18:18:25,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 18:18:25,552 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-07-12 18:18:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:25,553 INFO L225 Difference]: With dead ends: 94 [2022-07-12 18:18:25,553 INFO L226 Difference]: Without dead ends: 68 [2022-07-12 18:18:25,555 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=800, Invalid=9503, Unknown=7, NotChecked=402, Total=10712 [2022-07-12 18:18:25,555 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 54 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 1102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 602 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:25,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 430 Invalid, 1102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 490 Invalid, 0 Unknown, 602 Unchecked, 0.2s Time] [2022-07-12 18:18:25,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-12 18:18:25,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 63. [2022-07-12 18:18:25,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:25,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-07-12 18:18:25,557 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2022-07-12 18:18:25,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:25,558 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-07-12 18:18:25,558 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 75 states have (on average 2.0533333333333332) internal successors, (154), 75 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:25,558 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-07-12 18:18:25,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-12 18:18:25,558 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:25,559 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:25,581 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-07-12 18:18:25,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-12 18:18:25,781 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-12 18:18:25,781 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:25,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1063800910, now seen corresponding path program 9 times [2022-07-12 18:18:25,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:25,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783512132] [2022-07-12 18:18:25,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:25,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:25,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:26,510 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:26,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:26,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783512132] [2022-07-12 18:18:26,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783512132] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:26,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720471949] [2022-07-12 18:18:26,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:18:26,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:26,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:26,514 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-12 18:18:26,515 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-12 18:18:26,746 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-07-12 18:18:26,747 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:26,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 142 conjunts are in the unsatisfiable core [2022-07-12 18:18:26,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:26,765 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-07-12 18:18:26,939 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-12 18:18:27,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 14 treesize of output 16 [2022-07-12 18:18:27,102 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:27,192 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:27,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:27,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:18:27,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-12 18:18:27,497 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-12 18:18:27,499 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:27,499 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:27,507 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:18:27,512 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:27,516 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_631 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_631) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:27,525 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_630) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,536 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,545 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_629 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_629) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,556 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,562 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_628) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,569 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,575 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_627 (Array Int Int)) (v_ArrVal_632 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_627) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,582 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,586 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_632) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:27,591 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:27,595 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:18:27,601 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:27,601 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-12 18:18:27,606 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-12 18:18:27,989 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 14 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 83 not checked. [2022-07-12 18:18:27,989 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720471949] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:27,989 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:27,989 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 27, 27] total 69 [2022-07-12 18:18:27,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656291482] [2022-07-12 18:18:27,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:27,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-07-12 18:18:27,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:27,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-07-12 18:18:27,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=200, Invalid=2919, Unknown=13, NotChecked=1560, Total=4692 [2022-07-12 18:18:27,992 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:29,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:29,455 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2022-07-12 18:18:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-12 18:18:29,456 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2022-07-12 18:18:29,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:29,456 INFO L225 Difference]: With dead ends: 100 [2022-07-12 18:18:29,457 INFO L226 Difference]: Without dead ends: 70 [2022-07-12 18:18:29,458 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 85 SyntacticMatches, 17 SemanticMatches, 81 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 1389 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=288, Invalid=4581, Unknown=13, NotChecked=1924, Total=6806 [2022-07-12 18:18:29,458 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 36 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 678 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:29,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 573 Invalid, 2016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 1303 Invalid, 0 Unknown, 678 Unchecked, 0.5s Time] [2022-07-12 18:18:29,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-07-12 18:18:29,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 67. [2022-07-12 18:18:29,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:29,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-07-12 18:18:29,460 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-07-12 18:18:29,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:29,460 INFO L495 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-07-12 18:18:29,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 69 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:29,461 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-07-12 18:18:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-12 18:18:29,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:29,461 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:29,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-12 18:18:29,675 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-12 18:18:29,675 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-12 18:18:29,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:29,676 INFO L85 PathProgramCache]: Analyzing trace with hash 397481487, now seen corresponding path program 10 times [2022-07-12 18:18:29,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:29,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891899848] [2022-07-12 18:18:29,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:29,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:29,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:30,052 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 45 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:30,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891899848] [2022-07-12 18:18:30,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [891899848] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:30,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090732434] [2022-07-12 18:18:30,052 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:18:30,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:30,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:30,054 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-12 18:18:30,056 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-12 18:18:30,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:18:30,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:30,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 134 conjunts are in the unsatisfiable core [2022-07-12 18:18:30,206 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:30,219 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:18:30,219 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-12 18:18:30,225 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-12 18:18:30,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:18:30,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 18 treesize of output 20 [2022-07-12 18:18:30,897 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:31,012 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:31,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:31,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:31,378 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:18:31,500 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:31,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:18:31,672 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 72 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:31,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:32,889 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-12 18:18:32,903 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_713 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (<= (+ 8 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_713) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 6 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_120|)) 0))) is different from false [2022-07-12 18:18:32,911 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:32,912 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-12 18:18:32,918 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:32,919 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-12 18:18:32,925 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-12 18:18:33,986 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 91 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-07-12 18:18:33,987 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090732434] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:33,987 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:33,987 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 28, 28] total 74 [2022-07-12 18:18:33,987 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979629628] [2022-07-12 18:18:33,987 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:33,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 75 states [2022-07-12 18:18:33,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:33,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2022-07-12 18:18:33,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=542, Invalid=4716, Unknown=6, NotChecked=286, Total=5550 [2022-07-12 18:18:33,989 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:36,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:36,153 INFO L93 Difference]: Finished difference Result 75 states and 76 transitions. [2022-07-12 18:18:36,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-07-12 18:18:36,154 INFO L78 Accepts]: Start accepts. Automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2022-07-12 18:18:36,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:36,154 INFO L225 Difference]: With dead ends: 75 [2022-07-12 18:18:36,155 INFO L226 Difference]: Without dead ends: 75 [2022-07-12 18:18:36,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 80 SyntacticMatches, 5 SemanticMatches, 100 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1771 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=1409, Invalid=8457, Unknown=42, NotChecked=394, Total=10302 [2022-07-12 18:18:36,157 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 127 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 940 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 1601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 940 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 532 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:36,157 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 428 Invalid, 1601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 940 Invalid, 0 Unknown, 532 Unchecked, 0.4s Time] [2022-07-12 18:18:36,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-07-12 18:18:36,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2022-07-12 18:18:36,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:36,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-07-12 18:18:36,159 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 66 [2022-07-12 18:18:36,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:36,159 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-07-12 18:18:36,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 75 states, 74 states have (on average 2.5675675675675675) internal successors, (190), 75 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:36,160 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-07-12 18:18:36,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-12 18:18:36,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:36,160 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:36,179 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-07-12 18:18:36,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-12 18:18:36,367 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-12 18:18:36,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:36,368 INFO L85 PathProgramCache]: Analyzing trace with hash -2032213951, now seen corresponding path program 11 times [2022-07-12 18:18:36,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:36,368 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901078384] [2022-07-12 18:18:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:36,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:36,661 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 139 proven. 114 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:36,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901078384] [2022-07-12 18:18:36,661 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901078384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:36,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599062117] [2022-07-12 18:18:36,661 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:18:36,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:36,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:36,663 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-12 18:18:36,671 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-12 18:18:37,141 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2022-07-12 18:18:37,141 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:37,146 INFO L263 TraceCheckSpWp]: Trace formula consists of 511 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-12 18:18:37,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:37,160 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:18:37,160 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-12 18:18:37,726 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:37,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:38,105 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 154 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:38,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599062117] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:38,106 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:38,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 51 [2022-07-12 18:18:38,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057503721] [2022-07-12 18:18:38,106 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:38,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:18:38,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:38,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:18:38,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=412, Invalid=2138, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:18:38,107 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:38,805 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2022-07-12 18:18:38,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-12 18:18:38,805 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 74 [2022-07-12 18:18:38,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:38,806 INFO L225 Difference]: With dead ends: 118 [2022-07-12 18:18:38,806 INFO L226 Difference]: Without dead ends: 82 [2022-07-12 18:18:38,807 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 118 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1141 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=894, Invalid=3936, Unknown=0, NotChecked=0, Total=4830 [2022-07-12 18:18:38,807 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 119 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 501 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:38,807 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 154 Invalid, 501 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-12 18:18:38,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-12 18:18:38,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2022-07-12 18:18:38,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:38,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-07-12 18:18:38,809 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-07-12 18:18:38,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:38,810 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-07-12 18:18:38,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.411764705882353) internal successors, (174), 51 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:38,810 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-07-12 18:18:38,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-12 18:18:38,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:38,810 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:38,827 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-12 18:18:39,010 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:39,011 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 8 more)] === [2022-07-12 18:18:39,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:39,011 INFO L85 PathProgramCache]: Analyzing trace with hash -626482402, now seen corresponding path program 12 times [2022-07-12 18:18:39,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:39,011 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038176127] [2022-07-12 18:18:39,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:39,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038176127] [2022-07-12 18:18:40,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038176127] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:40,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030913328] [2022-07-12 18:18:40,023 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:18:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:40,024 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-12 18:18:40,031 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-12 18:18:40,651 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-07-12 18:18:40,652 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:40,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 158 conjunts are in the unsatisfiable core [2022-07-12 18:18:40,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:40,670 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-12 18:18:41,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, 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-12 18:18:41,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:18:41,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,487 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,539 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:18:41,602 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:41,607 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-12 18:18:41,610 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 264 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:41,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:41,621 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:18:41,627 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:41,632 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_885 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_885) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:18:41,638 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,644 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_884) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,650 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,656 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_883 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_883) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,663 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_882) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,676 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,682 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_881 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_881) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,688 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,692 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_880) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,697 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,701 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int)) (v_ArrVal_879 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_879) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,707 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,710 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_886 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_886) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:18:41,714 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:41,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:18:41,719 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:41,719 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-12 18:18:41,722 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-12 18:18:42,100 INFO L134 CoverageAnalysis]: Checked inductivity of 282 backedges. 18 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 143 not checked. [2022-07-12 18:18:42,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030913328] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:42,101 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:42,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 33, 33] total 80 [2022-07-12 18:18:42,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458209989] [2022-07-12 18:18:42,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:42,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2022-07-12 18:18:42,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:42,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2022-07-12 18:18:42,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3735, Unknown=17, NotChecked=2346, Total=6320 [2022-07-12 18:18:42,103 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:44,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:44,729 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2022-07-12 18:18:44,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-07-12 18:18:44,729 INFO L78 Accepts]: Start accepts. Automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 78 [2022-07-12 18:18:44,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:44,730 INFO L225 Difference]: With dead ends: 124 [2022-07-12 18:18:44,730 INFO L226 Difference]: Without dead ends: 86 [2022-07-12 18:18:44,731 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 110 SyntacticMatches, 20 SemanticMatches, 98 ConstructedPredicates, 17 IntricatePredicates, 1 DeprecatedPredicates, 1727 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=353, Invalid=6504, Unknown=17, NotChecked=3026, Total=9900 [2022-07-12 18:18:44,731 INFO L413 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 2916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1153 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:44,731 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 808 Invalid, 2916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 1731 Invalid, 0 Unknown, 1153 Unchecked, 0.9s Time] [2022-07-12 18:18:44,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-07-12 18:18:44,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 83. [2022-07-12 18:18:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-07-12 18:18:44,733 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-07-12 18:18:44,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:44,733 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-07-12 18:18:44,733 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 80 states, 80 states have (on average 2.1875) internal successors, (175), 80 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:44,733 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-07-12 18:18:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-07-12 18:18:44,734 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:44,734 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:44,763 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-12 18:18:44,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:44,948 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-12 18:18:44,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:44,948 INFO L85 PathProgramCache]: Analyzing trace with hash -605311109, now seen corresponding path program 13 times [2022-07-12 18:18:44,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:44,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1640325125] [2022-07-12 18:18:44,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:44,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:45,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:45,462 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 91 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:45,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:45,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1640325125] [2022-07-12 18:18:45,463 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1640325125] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:45,463 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1506360969] [2022-07-12 18:18:45,463 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:18:45,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:45,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:45,467 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-12 18:18:45,512 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-12 18:18:45,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:45,653 INFO L263 TraceCheckSpWp]: Trace formula consists of 539 conjuncts, 99 conjunts are in the unsatisfiable core [2022-07-12 18:18:45,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:46,095 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:46,095 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:46,564 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-07-12 18:18:46,621 INFO L134 CoverageAnalysis]: Checked inductivity of 315 backedges. 120 proven. 195 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:46,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1506360969] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:46,621 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:46,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24, 24] total 50 [2022-07-12 18:18:46,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1714187396] [2022-07-12 18:18:46,622 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:46,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-12 18:18:46,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:46,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-12 18:18:46,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=2262, Unknown=0, NotChecked=0, Total=2550 [2022-07-12 18:18:46,623 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:47,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:47,569 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-07-12 18:18:47,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-07-12 18:18:47,569 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 82 [2022-07-12 18:18:47,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:47,570 INFO L225 Difference]: With dead ends: 89 [2022-07-12 18:18:47,570 INFO L226 Difference]: Without dead ends: 89 [2022-07-12 18:18:47,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 135 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=993, Invalid=4263, Unknown=0, NotChecked=0, Total=5256 [2022-07-12 18:18:47,571 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 381 mSDsluCounter, 340 mSDsCounter, 0 mSdLazyCounter, 1059 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 1172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 1059 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:47,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 364 Invalid, 1172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 1059 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-12 18:18:47,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-07-12 18:18:47,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-07-12 18:18:47,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:47,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-07-12 18:18:47,573 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-07-12 18:18:47,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:47,574 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-07-12 18:18:47,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 3.28) internal successors, (164), 51 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:47,574 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-07-12 18:18:47,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-12 18:18:47,574 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:47,574 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:47,592 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-12 18:18:47,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:47,775 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-12 18:18:47,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1757632300, now seen corresponding path program 14 times [2022-07-12 18:18:47,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:47,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833746519] [2022-07-12 18:18:47,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:47,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:47,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:18:48,863 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 20 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:48,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:18:48,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833746519] [2022-07-12 18:18:48,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833746519] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:18:48,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996946579] [2022-07-12 18:18:48,864 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:18:48,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:48,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:18:48,866 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-12 18:18:48,867 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-12 18:18:49,030 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:18:49,030 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:18:49,034 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 169 conjunts are in the unsatisfiable core [2022-07-12 18:18:49,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:18:49,041 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-12 18:18:49,425 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-12 18:18:49,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:49,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-12 18:18:49,960 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:50,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:50,279 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:50,453 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:18:50,629 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:50,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:18:50,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:18:51,204 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:51,204 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-12 18:18:51,387 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 233 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:18:51,388 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:18:53,303 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)))) is different from false [2022-07-12 18:18:53,316 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| Int) (v_ArrVal_1074 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) (<= (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202| 11) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1074) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 9 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_202|))) is different from false [2022-07-12 18:18:53,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:53,323 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-12 18:18:53,329 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:18:53,329 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-12 18:18:53,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-12 18:18:53,336 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-12 18:18:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 353 backedges. 120 proven. 223 refuted. 0 times theorem prover too weak. 0 trivial. 10 not checked. [2022-07-12 18:18:54,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1996946579] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:18:54,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:18:54,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 36, 36] total 115 [2022-07-12 18:18:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963080847] [2022-07-12 18:18:54,180 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:18:54,180 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 115 states [2022-07-12 18:18:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:18:54,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2022-07-12 18:18:54,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=766, Invalid=11887, Unknown=11, NotChecked=446, Total=13110 [2022-07-12 18:18:54,182 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:18:58,661 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2022-07-12 18:18:58,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2022-07-12 18:18:58,663 INFO L78 Accepts]: Start accepts. Automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 86 [2022-07-12 18:18:58,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:18:58,664 INFO L225 Difference]: With dead ends: 142 [2022-07-12 18:18:58,664 INFO L226 Difference]: Without dead ends: 100 [2022-07-12 18:18:58,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 4830 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1639, Invalid=23164, Unknown=11, NotChecked=626, Total=25440 [2022-07-12 18:18:58,666 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 107 mSDsluCounter, 750 mSDsCounter, 0 mSdLazyCounter, 793 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 775 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 793 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1154 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:18:58,667 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 775 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 793 Invalid, 0 Unknown, 1154 Unchecked, 0.3s Time] [2022-07-12 18:18:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-07-12 18:18:58,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 95. [2022-07-12 18:18:58,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:58,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-07-12 18:18:58,672 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 86 [2022-07-12 18:18:58,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:18:58,672 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-07-12 18:18:58,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 115 states, 115 states have (on average 2.1739130434782608) internal successors, (250), 115 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:18:58,673 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-07-12 18:18:58,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-12 18:18:58,678 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:18:58,678 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:18:58,697 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-12 18:18:58,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:18:58,883 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-12 18:18:58,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:18:58,884 INFO L85 PathProgramCache]: Analyzing trace with hash -486951286, now seen corresponding path program 15 times [2022-07-12 18:18:58,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:18:58,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270795551] [2022-07-12 18:18:58,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:18:58,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:18:58,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:00,367 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:00,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270795551] [2022-07-12 18:19:00,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270795551] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:00,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754722087] [2022-07-12 18:19:00,367 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:19:00,367 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:00,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:00,369 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-12 18:19:00,370 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-12 18:19:02,830 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2022-07-12 18:19:02,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:02,843 INFO L263 TraceCheckSpWp]: Trace formula consists of 621 conjuncts, 188 conjunts are in the unsatisfiable core [2022-07-12 18:19:02,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:02,859 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-12 18:19:03,502 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-12 18:19:03,710 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:03,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-12 18:19:03,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:03,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:04,023 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:04,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:04,156 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:04,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:04,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 16 treesize of output 18 [2022-07-12 18:19:04,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:04,312 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-12 18:19:04,315 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:04,315 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:04,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:04,333 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:19:04,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1184 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1184) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:19:04,346 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,351 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1183 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1183) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,357 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,381 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int)) (v_ArrVal_1182 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1182) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,388 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:04,394 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1181 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1181) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,403 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,409 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1180) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,416 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1179 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1179) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,446 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,452 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1178 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1178) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,458 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,464 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1177 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1177) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,471 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,478 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array Int Int)) (v_ArrVal_1185 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1176) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:04,503 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:19:04,508 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1185 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1185) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |c_ULTIMATE.start_main_~nondetString~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:19:04,513 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:04,514 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-12 18:19:04,521 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:04,521 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:04,529 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-12 18:19:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 432 backedges. 22 proven. 191 refuted. 0 times theorem prover too weak. 0 trivial. 219 not checked. [2022-07-12 18:19:04,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754722087] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:04,895 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:04,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 39, 39] total 96 [2022-07-12 18:19:04,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443524694] [2022-07-12 18:19:04,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:04,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 96 states [2022-07-12 18:19:04,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:04,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2022-07-12 18:19:04,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=5347, Unknown=21, NotChecked=3486, Total=9120 [2022-07-12 18:19:04,897 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:07,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:07,807 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2022-07-12 18:19:07,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-07-12 18:19:07,808 INFO L78 Accepts]: Start accepts. Automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 94 [2022-07-12 18:19:07,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:07,808 INFO L225 Difference]: With dead ends: 148 [2022-07-12 18:19:07,808 INFO L226 Difference]: Without dead ends: 102 [2022-07-12 18:19:07,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 274 GetRequests, 137 SyntacticMatches, 21 SemanticMatches, 116 ConstructedPredicates, 21 IntricatePredicates, 0 DeprecatedPredicates, 2229 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=398, Invalid=8977, Unknown=21, NotChecked=4410, Total=13806 [2022-07-12 18:19:07,810 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 52 mSDsluCounter, 1042 mSDsCounter, 0 mSdLazyCounter, 2380 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 4157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 2380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1735 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:07,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 1068 Invalid, 4157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 2380 Invalid, 0 Unknown, 1735 Unchecked, 1.0s Time] [2022-07-12 18:19:07,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-07-12 18:19:07,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2022-07-12 18:19:07,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:07,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-07-12 18:19:07,812 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-07-12 18:19:07,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:07,812 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-07-12 18:19:07,812 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 96 states, 96 states have (on average 2.21875) internal successors, (213), 96 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:07,812 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-07-12 18:19:07,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-07-12 18:19:07,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:07,813 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:07,847 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-12 18:19:08,025 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:08,026 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-12 18:19:08,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:08,026 INFO L85 PathProgramCache]: Analyzing trace with hash 1113221351, now seen corresponding path program 16 times [2022-07-12 18:19:08,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:08,026 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996201784] [2022-07-12 18:19:08,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:08,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:08,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:08,623 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 153 proven. 320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:08,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:08,623 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996201784] [2022-07-12 18:19:08,624 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996201784] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:08,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858218116] [2022-07-12 18:19:08,624 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:19:08,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:08,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:08,625 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-12 18:19:08,650 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-12 18:19:08,822 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:19:08,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:08,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 597 conjuncts, 192 conjunts are in the unsatisfiable core [2022-07-12 18:19:08,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:08,843 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:08,844 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-12 18:19:08,849 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-12 18:19:09,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:19:09,679 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:09,792 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:09,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,032 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,271 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,530 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,786 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:19:10,925 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:10,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:19:11,104 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 200 proven. 273 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:11,104 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:13,113 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-12 18:19:13,123 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| Int) (v_ArrVal_1303 (Array Int Int))) (or (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (<= (+ 12 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1303) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250| 10)) 0) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_250|)))) is different from false [2022-07-12 18:19:13,128 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:13,129 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-12 18:19:13,134 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:13,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 37 [2022-07-12 18:19:13,139 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-12 18:19:15,035 INFO L134 CoverageAnalysis]: Checked inductivity of 473 backedges. 231 proven. 231 refuted. 0 times theorem prover too weak. 0 trivial. 11 not checked. [2022-07-12 18:19:15,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858218116] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:15,035 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:15,035 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 40, 40] total 106 [2022-07-12 18:19:15,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697817375] [2022-07-12 18:19:15,036 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:15,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 107 states [2022-07-12 18:19:15,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:15,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2022-07-12 18:19:15,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1079, Invalid=9835, Unknown=14, NotChecked=414, Total=11342 [2022-07-12 18:19:15,038 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:19,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:19,284 INFO L93 Difference]: Finished difference Result 107 states and 108 transitions. [2022-07-12 18:19:19,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-07-12 18:19:19,285 INFO L78 Accepts]: Start accepts. Automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 98 [2022-07-12 18:19:19,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:19,286 INFO L225 Difference]: With dead ends: 107 [2022-07-12 18:19:19,286 INFO L226 Difference]: Without dead ends: 107 [2022-07-12 18:19:19,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 118 SyntacticMatches, 13 SemanticMatches, 142 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 3814 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=2857, Invalid=17099, Unknown=74, NotChecked=562, Total=20592 [2022-07-12 18:19:19,287 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 266 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 266 SdHoareTripleChecker+Valid, 883 SdHoareTripleChecker+Invalid, 3144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1176 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:19,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [266 Valid, 883 Invalid, 3144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1724 Invalid, 0 Unknown, 1176 Unchecked, 0.8s Time] [2022-07-12 18:19:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-12 18:19:19,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-12 18:19:19,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:19,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-07-12 18:19:19,290 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 98 [2022-07-12 18:19:19,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:19,290 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-07-12 18:19:19,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 107 states, 106 states have (on average 2.69811320754717) internal successors, (286), 107 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:19,290 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-07-12 18:19:19,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-12 18:19:19,291 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:19,291 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:19,313 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-12 18:19:19,507 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:19,508 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-12 18:19:19,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:19,508 INFO L85 PathProgramCache]: Analyzing trace with hash -36447463, now seen corresponding path program 17 times [2022-07-12 18:19:19,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:19,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411945792] [2022-07-12 18:19:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:20,066 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 303 proven. 266 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:20,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:20,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411945792] [2022-07-12 18:19:20,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411945792] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:20,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [276143447] [2022-07-12 18:19:20,067 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:19:20,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:20,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:20,069 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-12 18:19:20,070 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-12 18:19:23,123 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 14 check-sat command(s) [2022-07-12 18:19:23,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:23,140 INFO L263 TraceCheckSpWp]: Trace formula consists of 703 conjuncts, 104 conjunts are in the unsatisfiable core [2022-07-12 18:19:23,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:23,164 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:19:23,165 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-12 18:19:24,321 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:24,321 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:25,162 INFO L134 CoverageAnalysis]: Checked inductivity of 569 backedges. 326 proven. 243 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:25,162 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [276143447] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:25,162 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:25,162 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29, 29] total 72 [2022-07-12 18:19:25,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955874698] [2022-07-12 18:19:25,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:25,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 72 states [2022-07-12 18:19:25,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:25,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2022-07-12 18:19:25,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=879, Invalid=4233, Unknown=0, NotChecked=0, Total=5112 [2022-07-12 18:19:25,164 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:25,950 INFO L93 Difference]: Finished difference Result 166 states and 167 transitions. [2022-07-12 18:19:25,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-12 18:19:25,951 INFO L78 Accepts]: Start accepts. Automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 106 [2022-07-12 18:19:25,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:25,952 INFO L225 Difference]: With dead ends: 166 [2022-07-12 18:19:25,952 INFO L226 Difference]: Without dead ends: 114 [2022-07-12 18:19:25,952 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 257 GetRequests, 170 SyntacticMatches, 1 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1851 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1509, Invalid=6147, Unknown=0, NotChecked=0, Total=7656 [2022-07-12 18:19:25,953 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 129 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:25,953 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 242 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-12 18:19:25,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-07-12 18:19:25,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2022-07-12 18:19:25,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-07-12 18:19:25,955 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-07-12 18:19:25,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:25,961 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-07-12 18:19:25,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 72 states, 72 states have (on average 3.5277777777777777) internal successors, (254), 72 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:25,961 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-07-12 18:19:25,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-12 18:19:25,962 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:25,962 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:25,999 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-12 18:19:26,179 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-07-12 18:19:26,179 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-12 18:19:26,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 223537654, now seen corresponding path program 18 times [2022-07-12 18:19:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:26,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720560468] [2022-07-12 18:19:26,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:26,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:28,077 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:28,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720560468] [2022-07-12 18:19:28,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720560468] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:28,077 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2051577359] [2022-07-12 18:19:28,077 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:19:28,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:28,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:28,079 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-12 18:19:28,080 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-12 18:19:32,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 14 check-sat command(s) [2022-07-12 18:19:32,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:32,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 717 conjuncts, 290 conjunts are in the unsatisfiable core [2022-07-12 18:19:32,645 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:32,650 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-12 18:19:33,533 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-12 18:19:33,769 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:33,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,166 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,835 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:34,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-12 18:19:35,161 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:35,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:35,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:35,678 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:19:35,835 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:19:35,836 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:35,836 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-12 18:19:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 588 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:35,840 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:35,847 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:19:35,852 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:19:35,856 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1543 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1543) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:19:35,861 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,865 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1542 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1542) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,870 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,874 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1541 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1541) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,879 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,883 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1540 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1540) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,888 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:35,892 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int)) (v_ArrVal_1539 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1539) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,897 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,914 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1538 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1538) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,919 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,923 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1537 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1537) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:35,938 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1536 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1536) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,943 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:35,947 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1535 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1535) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,952 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:19:35,956 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1534 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1534) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:19:35,969 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:19:35,976 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1533 (Array Int Int)) (v_ArrVal_1544 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1533) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:19:35,981 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,984 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1544 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1544) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 12 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:19:35,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:35,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:19:35,999 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:35,999 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-12 18:19:36,003 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-12 18:19:36,956 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 26 proven. 277 refuted. 0 times theorem prover too weak. 0 trivial. 311 not checked. [2022-07-12 18:19:36,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2051577359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:36,956 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:36,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 45, 45] total 139 [2022-07-12 18:19:36,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756193578] [2022-07-12 18:19:36,957 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:36,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-12 18:19:36,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:36,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-12 18:19:36,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=12535, Unknown=25, NotChecked=6200, Total=19182 [2022-07-12 18:19:36,959 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:40,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:40,181 INFO L93 Difference]: Finished difference Result 172 states and 173 transitions. [2022-07-12 18:19:40,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-07-12 18:19:40,182 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 110 [2022-07-12 18:19:40,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:40,182 INFO L225 Difference]: With dead ends: 172 [2022-07-12 18:19:40,182 INFO L226 Difference]: Without dead ends: 118 [2022-07-12 18:19:40,184 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 325 GetRequests, 142 SyntacticMatches, 13 SemanticMatches, 170 ConstructedPredicates, 25 IntricatePredicates, 7 DeprecatedPredicates, 6609 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=653, Invalid=20884, Unknown=25, NotChecked=7850, Total=29412 [2022-07-12 18:19:40,184 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 49 mSDsluCounter, 1729 mSDsCounter, 0 mSdLazyCounter, 1989 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 4928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1989 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2923 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:40,184 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 1759 Invalid, 4928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1989 Invalid, 0 Unknown, 2923 Unchecked, 0.7s Time] [2022-07-12 18:19:40,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-07-12 18:19:40,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 115. [2022-07-12 18:19:40,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:40,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-07-12 18:19:40,187 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-07-12 18:19:40,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-07-12 18:19:40,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 139 states have (on average 2.237410071942446) internal successors, (311), 139 states have internal predecessors, (311), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-07-12 18:19:40,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-12 18:19:40,188 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:40,188 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:40,212 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-12 18:19:40,399 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-07-12 18:19:40,399 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-12 18:19:40,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:40,400 INFO L85 PathProgramCache]: Analyzing trace with hash 382026323, now seen corresponding path program 19 times [2022-07-12 18:19:40,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:40,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303157461] [2022-07-12 18:19:40,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:40,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:41,067 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 231 proven. 432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:41,067 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303157461] [2022-07-12 18:19:41,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303157461] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:41,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [485827743] [2022-07-12 18:19:41,068 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:19:41,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:41,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:41,072 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-12 18:19:41,111 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-12 18:19:41,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:41,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 731 conjuncts, 135 conjunts are in the unsatisfiable core [2022-07-12 18:19:41,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:42,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:42,902 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-12 18:19:42,989 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 276 proven. 387 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:42,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [485827743] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:42,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:42,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32, 32] total 65 [2022-07-12 18:19:42,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081051772] [2022-07-12 18:19:42,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:42,990 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-07-12 18:19:42,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:42,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-07-12 18:19:42,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=404, Invalid=3886, Unknown=0, NotChecked=0, Total=4290 [2022-07-12 18:19:42,991 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:19:45,422 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-07-12 18:19:45,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-07-12 18:19:45,423 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 114 [2022-07-12 18:19:45,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:19:45,423 INFO L225 Difference]: With dead ends: 121 [2022-07-12 18:19:45,423 INFO L226 Difference]: Without dead ends: 121 [2022-07-12 18:19:45,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 191 SyntacticMatches, 2 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1609 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2253, Invalid=9303, Unknown=0, NotChecked=0, Total=11556 [2022-07-12 18:19:45,425 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 442 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 2060 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 2060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-12 18:19:45,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 696 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 2060 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-12 18:19:45,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-12 18:19:45,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-07-12 18:19:45,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-07-12 18:19:45,443 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-07-12 18:19:45,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:19:45,443 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-07-12 18:19:45,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 65 states have (on average 3.5076923076923077) internal successors, (228), 66 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:19:45,443 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-07-12 18:19:45,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-12 18:19:45,446 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:19:45,446 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:19:45,474 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-12 18:19:45,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-12 18:19:45,659 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-12 18:19:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:19:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash -757002324, now seen corresponding path program 20 times [2022-07-12 18:19:45,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:19:45,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564460627] [2022-07-12 18:19:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:19:45,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:19:45,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:19:47,815 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 28 proven. 689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:47,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:19:47,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564460627] [2022-07-12 18:19:47,816 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1564460627] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:19:47,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583807598] [2022-07-12 18:19:47,816 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:19:47,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:19:47,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:19:47,818 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-12 18:19:47,820 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-12 18:19:48,089 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:19:48,090 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:19:48,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 765 conjuncts, 227 conjunts are in the unsatisfiable core [2022-07-12 18:19:48,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:19:48,106 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-12 18:19:49,073 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-07-12 18:19:49,437 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:19:49,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:19:49,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:50,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:50,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:50,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 17 treesize of output 19 [2022-07-12 18:19:50,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:51,114 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:51,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:51,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:51,870 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:19:52,133 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:52,361 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:19:52,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:52,598 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-12 18:19:52,834 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:19:52,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:19:56,821 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:19:56,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1801 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| Int)) (or (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|)) (<= (+ 15 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364|) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1801) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_364| 13)) 0))) is different from false [2022-07-12 18:19:56,843 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:56,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-12 18:19:56,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:19:56,865 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-12 18:19:56,870 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-12 18:19:56,874 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-12 18:19:59,016 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 276 proven. 427 refuted. 0 times theorem prover too weak. 0 trivial. 14 not checked. [2022-07-12 18:19:59,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583807598] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:19:59,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:19:59,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 48, 48] total 155 [2022-07-12 18:19:59,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054412099] [2022-07-12 18:19:59,017 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:19:59,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 155 states [2022-07-12 18:19:59,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:19:59,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2022-07-12 18:19:59,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1307, Invalid=21941, Unknown=16, NotChecked=606, Total=23870 [2022-07-12 18:19:59,019 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:09,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:09,092 INFO L93 Difference]: Finished difference Result 190 states and 191 transitions. [2022-07-12 18:20:09,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2022-07-12 18:20:09,093 INFO L78 Accepts]: Start accepts. Automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 118 [2022-07-12 18:20:09,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:09,094 INFO L225 Difference]: With dead ends: 190 [2022-07-12 18:20:09,094 INFO L226 Difference]: Without dead ends: 132 [2022-07-12 18:20:09,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 9205 ImplicationChecksByTransitivity, 20.3s TimeCoverageRelationStatistics Valid=2748, Invalid=42826, Unknown=16, NotChecked=850, Total=46440 [2022-07-12 18:20:09,096 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 174 mSDsluCounter, 1533 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 1566 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1189 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:09,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 1566 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1448 Invalid, 0 Unknown, 1189 Unchecked, 0.6s Time] [2022-07-12 18:20:09,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-12 18:20:09,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 127. [2022-07-12 18:20:09,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:09,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-07-12 18:20:09,099 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 118 [2022-07-12 18:20:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:09,100 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-07-12 18:20:09,100 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 155 states, 155 states have (on average 2.232258064516129) internal successors, (346), 155 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:09,100 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-07-12 18:20:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-07-12 18:20:09,100 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:09,100 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:09,129 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-07-12 18:20:09,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:09,321 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-12 18:20:09,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:09,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1971076450, now seen corresponding path program 21 times [2022-07-12 18:20:09,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:09,322 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288271642] [2022-07-12 18:20:09,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:09,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:09,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:11,918 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:11,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288271642] [2022-07-12 18:20:11,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288271642] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:11,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805299767] [2022-07-12 18:20:11,919 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-12 18:20:11,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:11,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:11,923 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-12 18:20:11,924 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-12 18:20:19,032 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 16 check-sat command(s) [2022-07-12 18:20:19,032 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:19,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 328 conjunts are in the unsatisfiable core [2022-07-12 18:20:19,057 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:19,064 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-12 18:20:20,149 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-12 18:20:20,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 16 treesize of output 18 [2022-07-12 18:20:20,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:20,742 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:20,931 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:21,122 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:21,306 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:21,481 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:21,661 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:21,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,029 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,417 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:20:22,970 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-12 18:20:22,971 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:22,971 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-12 18:20:22,975 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 798 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:22,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:22,983 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:20:22,987 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:20:22,991 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1947 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1947) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:20:22,999 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,003 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1946 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1946) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,008 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,012 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1945 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1945) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,022 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1944 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1944) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,034 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,039 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1943 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1943) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,043 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1942 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1942) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,053 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,057 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1941 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1941) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,062 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,068 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1940 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1940) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:20:23,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,081 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1939 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1939) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,088 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:20:23,094 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1938 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1938) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:20:23,101 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:20:23,107 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1937 (Array Int Int)) (v_ArrVal_1948 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1937) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:20:23,112 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,116 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1936 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1936) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,121 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,126 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int)) (v_ArrVal_1935 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_1935) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,130 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,134 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1948 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_1948) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:20:23,137 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:23,137 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-12 18:20:23,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:23,142 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-12 18:20:23,144 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-12 18:20:24,571 INFO L134 CoverageAnalysis]: Checked inductivity of 828 backedges. 30 proven. 379 refuted. 0 times theorem prover too weak. 0 trivial. 419 not checked. [2022-07-12 18:20:24,571 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805299767] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:24,571 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:24,572 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 51, 51] total 159 [2022-07-12 18:20:24,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846271968] [2022-07-12 18:20:24,572 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:24,572 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 159 states [2022-07-12 18:20:24,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:24,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2022-07-12 18:20:24,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=482, Invalid=16375, Unknown=29, NotChecked=8236, Total=25122 [2022-07-12 18:20:24,574 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:29,881 INFO L93 Difference]: Finished difference Result 196 states and 197 transitions. [2022-07-12 18:20:29,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2022-07-12 18:20:29,882 INFO L78 Accepts]: Start accepts. Automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 126 [2022-07-12 18:20:29,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:29,882 INFO L225 Difference]: With dead ends: 196 [2022-07-12 18:20:29,882 INFO L226 Difference]: Without dead ends: 134 [2022-07-12 18:20:29,885 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 372 GetRequests, 158 SyntacticMatches, 15 SemanticMatches, 199 ConstructedPredicates, 29 IntricatePredicates, 13 DeprecatedPredicates, 9179 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=775, Invalid=28724, Unknown=29, NotChecked=10672, Total=40200 [2022-07-12 18:20:29,885 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 49 mSDsluCounter, 2127 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 2161 SdHoareTripleChecker+Invalid, 5308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 2894 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:29,885 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 2161 Invalid, 5308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2397 Invalid, 0 Unknown, 2894 Unchecked, 1.0s Time] [2022-07-12 18:20:29,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-12 18:20:29,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2022-07-12 18:20:29,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-07-12 18:20:29,888 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-07-12 18:20:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:29,888 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-07-12 18:20:29,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 159 states, 159 states have (on average 2.257861635220126) internal successors, (359), 159 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-07-12 18:20:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-12 18:20:29,892 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:29,892 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:29,926 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-12 18:20:30,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-07-12 18:20:30,103 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-12 18:20:30,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:30,104 INFO L85 PathProgramCache]: Analyzing trace with hash 217332671, now seen corresponding path program 22 times [2022-07-12 18:20:30,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:30,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940429739] [2022-07-12 18:20:30,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:30,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:30,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:30,925 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 325 proven. 560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:30,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940429739] [2022-07-12 18:20:30,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940429739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:30,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2099818915] [2022-07-12 18:20:30,925 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-12 18:20:30,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:30,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:30,927 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-12 18:20:30,931 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-12 18:20:31,201 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-12 18:20:31,201 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:31,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 777 conjuncts, 248 conjunts are in the unsatisfiable core [2022-07-12 18:20:31,212 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:31,217 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-12 18:20:31,221 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-12 18:20:32,218 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:20:32,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:32,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:32,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:32,793 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:32,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:33,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 18 treesize of output 20 [2022-07-12 18:20:33,201 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:33,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:33,541 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:33,754 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:33,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 18 treesize of output 20 [2022-07-12 18:20:34,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 18 treesize of output 20 [2022-07-12 18:20:34,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:34,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-07-12 18:20:34,518 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:34,518 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2022-07-12 18:20:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 392 proven. 493 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:34,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:37,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) 0) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)))) is different from false [2022-07-12 18:20:37,909 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2102 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428| Int)) (or (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2102) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 14 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) (<= (+ 16 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|)) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_428|))) is different from false [2022-07-12 18:20:37,915 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:37,915 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-12 18:20:37,920 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:20:37,920 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-12 18:20:37,923 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-12 18:20:40,758 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 435 proven. 435 refuted. 0 times theorem prover too weak. 0 trivial. 15 not checked. [2022-07-12 18:20:40,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2099818915] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:40,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:40,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 52, 52] total 138 [2022-07-12 18:20:40,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264695044] [2022-07-12 18:20:40,759 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:40,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 139 states [2022-07-12 18:20:40,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:40,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2022-07-12 18:20:40,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1812, Invalid=16813, Unknown=15, NotChecked=542, Total=19182 [2022-07-12 18:20:40,761 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:46,310 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1))) (and (<= 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) (<= .cse0 .cse1) (<= 15 .cse1) (or (= |c_ULTIMATE.start_cstrncpy_#t~mem5#1| 0) (not (= (+ (- 1) .cse1) (+ (- 1) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) (or (and (<= (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) .cse1) (<= 0 .cse0)) (forall ((v_ArrVal_2102 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2102) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0))) (<= |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 15))) is different from false [2022-07-12 18:20:46,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:46,635 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2022-07-12 18:20:46,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-07-12 18:20:46,635 INFO L78 Accepts]: Start accepts. Automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 130 [2022-07-12 18:20:46,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:46,636 INFO L225 Difference]: With dead ends: 139 [2022-07-12 18:20:46,636 INFO L226 Difference]: Without dead ends: 139 [2022-07-12 18:20:46,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 164 SyntacticMatches, 9 SemanticMatches, 189 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 6611 ImplicationChecksByTransitivity, 12.9s TimeCoverageRelationStatistics Valid=5187, Invalid=29901, Unknown=80, NotChecked=1122, Total=36290 [2022-07-12 18:20:46,638 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 230 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 1579 mSolverCounterSat, 199 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 230 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 199 IncrementalHoareTripleChecker+Valid, 1579 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1799 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:46,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [230 Valid, 1060 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [199 Valid, 1579 Invalid, 0 Unknown, 1799 Unchecked, 0.7s Time] [2022-07-12 18:20:46,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-07-12 18:20:46,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2022-07-12 18:20:46,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 138 states have (on average 1.0144927536231885) internal successors, (140), 138 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:46,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 140 transitions. [2022-07-12 18:20:46,640 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 140 transitions. Word has length 130 [2022-07-12 18:20:46,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:46,641 INFO L495 AbstractCegarLoop]: Abstraction has 139 states and 140 transitions. [2022-07-12 18:20:46,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 139 states, 138 states have (on average 2.7681159420289854) internal successors, (382), 139 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:46,641 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 140 transitions. [2022-07-12 18:20:46,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-12 18:20:46,642 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:46,642 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:46,664 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Ended with exit code 0 [2022-07-12 18:20:46,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-07-12 18:20:46,859 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-12 18:20:46,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:46,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1547261425, now seen corresponding path program 23 times [2022-07-12 18:20:46,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:46,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593457055] [2022-07-12 18:20:46,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:46,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:46,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:20:47,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 531 proven. 482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:47,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:20:47,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593457055] [2022-07-12 18:20:47,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593457055] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:20:47,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [829985101] [2022-07-12 18:20:47,468 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-07-12 18:20:47,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:20:47,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:20:47,469 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-12 18:20:47,470 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-12 18:20:53,407 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 18 check-sat command(s) [2022-07-12 18:20:53,408 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:20:53,427 INFO L263 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 132 conjunts are in the unsatisfiable core [2022-07-12 18:20:53,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:20:53,440 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-12 18:20:53,440 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-12 18:20:54,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:54,889 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:20:55,928 INFO L134 CoverageAnalysis]: Checked inductivity of 1013 backedges. 562 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:20:55,929 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [829985101] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:20:55,929 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:20:55,929 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 91 [2022-07-12 18:20:55,929 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630776588] [2022-07-12 18:20:55,929 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:20:55,930 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 91 states [2022-07-12 18:20:55,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:20:55,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2022-07-12 18:20:55,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1308, Invalid=6882, Unknown=0, NotChecked=0, Total=8190 [2022-07-12 18:20:55,931 INFO L87 Difference]: Start difference. First operand 139 states and 140 transitions. Second operand has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:20:57,391 INFO L93 Difference]: Finished difference Result 214 states and 215 transitions. [2022-07-12 18:20:57,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-07-12 18:20:57,391 INFO L78 Accepts]: Start accepts. Automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2022-07-12 18:20:57,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:20:57,392 INFO L225 Difference]: With dead ends: 214 [2022-07-12 18:20:57,392 INFO L226 Difference]: Without dead ends: 146 [2022-07-12 18:20:57,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4077 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=2802, Invalid=12948, Unknown=0, NotChecked=0, Total=15750 [2022-07-12 18:20:57,394 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 146 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 853 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 853 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-12 18:20:57,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 267 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 853 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-12 18:20:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-12 18:20:57,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 143. [2022-07-12 18:20:57,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.0140845070422535) internal successors, (144), 142 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 144 transitions. [2022-07-12 18:20:57,396 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 144 transitions. Word has length 138 [2022-07-12 18:20:57,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:20:57,397 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 144 transitions. [2022-07-12 18:20:57,397 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 91 states, 91 states have (on average 3.67032967032967) internal successors, (334), 91 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:20:57,397 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 144 transitions. [2022-07-12 18:20:57,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-12 18:20:57,398 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:20:57,398 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:20:57,430 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-12 18:20:57,623 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-07-12 18:20:57,623 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-12 18:20:57,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:20:57,624 INFO L85 PathProgramCache]: Analyzing trace with hash 524136654, now seen corresponding path program 24 times [2022-07-12 18:20:57,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:20:57,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193219822] [2022-07-12 18:20:57,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:20:57,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:20:57,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:00,033 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:00,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:21:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193219822] [2022-07-12 18:21:00,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193219822] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:21:00,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218175068] [2022-07-12 18:21:00,033 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-07-12 18:21:00,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:00,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:21:00,035 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-12 18:21:00,035 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-12 18:21:34,447 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 18 check-sat command(s) [2022-07-12 18:21:34,448 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:21:34,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 909 conjuncts, 284 conjunts are in the unsatisfiable core [2022-07-12 18:21:34,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:21:34,525 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-12 18:21:35,669 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 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-12 18:21:35,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 17 treesize of output 19 [2022-07-12 18:21:36,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,135 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,207 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,442 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,816 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,892 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:36,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:37,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-07-12 18:21:37,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 14 treesize of output 16 [2022-07-12 18:21:37,201 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-12 18:21:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 1040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:37,204 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:21:37,212 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|) 0)) is different from false [2022-07-12 18:21:37,216 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:21:37,220 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2411 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2411) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 1)) 0)) is different from false [2022-07-12 18:21:37,225 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:21:37,229 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2410 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2410) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 2 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,233 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,237 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2409 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2409) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 3 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,241 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,246 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2408 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2408) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 4 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,250 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,254 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2407 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2407) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 5 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,258 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,262 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2406 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2406) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 6 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,268 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2405 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2405) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 7 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,276 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,281 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2404 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2404) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 8 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,285 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2403 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2403) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 9 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,302 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:21:37,306 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2402 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2402) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 10)) 0)) is different from false [2022-07-12 18:21:37,310 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)) 0)) is different from false [2022-07-12 18:21:37,315 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2401 (Array Int Int)) (v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2401) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |c_ULTIMATE.start_cstrncpy_~src~0#1.offset| 11)))) is different from false [2022-07-12 18:21:37,319 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:21:37,323 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2400 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2400) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 12 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,331 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,335 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2399 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2399) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 13 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,339 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,344 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2398 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2398) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 14 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,348 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= 0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)))) is different from false [2022-07-12 18:21:37,352 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int)) (v_ArrVal_2397 (Array Int Int))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_#t~post3#1.base| v_ArrVal_2397) |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 15 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,356 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ 16 |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,359 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2412 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2412) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ 16 |c_ULTIMATE.start_main_~nondetString~0#1.offset|)) 0)) is different from false [2022-07-12 18:21:37,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:37,363 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-12 18:21:37,368 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:37,368 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-12 18:21:37,370 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-12 18:21:37,884 INFO L134 CoverageAnalysis]: Checked inductivity of 1074 backedges. 34 proven. 497 refuted. 0 times theorem prover too weak. 0 trivial. 543 not checked. [2022-07-12 18:21:37,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218175068] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:21:37,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:21:37,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [73, 57, 57] total 146 [2022-07-12 18:21:37,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152326454] [2022-07-12 18:21:37,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:21:37,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 146 states [2022-07-12 18:21:37,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:21:37,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2022-07-12 18:21:37,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=12349, Unknown=33, NotChecked=8382, Total=21170 [2022-07-12 18:21:37,887 INFO L87 Difference]: Start difference. First operand 143 states and 144 transitions. Second operand has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:44,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:21:44,256 INFO L93 Difference]: Finished difference Result 220 states and 221 transitions. [2022-07-12 18:21:44,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2022-07-12 18:21:44,256 INFO L78 Accepts]: Start accepts. Automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 142 [2022-07-12 18:21:44,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:21:44,257 INFO L225 Difference]: With dead ends: 220 [2022-07-12 18:21:44,257 INFO L226 Difference]: Without dead ends: 150 [2022-07-12 18:21:44,259 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 205 SyntacticMatches, 51 SemanticMatches, 179 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 6480 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=614, Invalid=21241, Unknown=33, NotChecked=10692, Total=32580 [2022-07-12 18:21:44,259 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 44 mSDsluCounter, 2397 mSDsCounter, 0 mSdLazyCounter, 6045 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 2435 SdHoareTripleChecker+Invalid, 10271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 6045 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4163 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:21:44,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 2435 Invalid, 10271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 6045 Invalid, 0 Unknown, 4163 Unchecked, 2.1s Time] [2022-07-12 18:21:44,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-07-12 18:21:44,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 147. [2022-07-12 18:21:44,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 146 states have (on average 1.0136986301369864) internal successors, (148), 146 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:44,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2022-07-12 18:21:44,262 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 142 [2022-07-12 18:21:44,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:21:44,262 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2022-07-12 18:21:44,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 146 states, 146 states have (on average 2.26027397260274) internal successors, (330), 146 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:44,263 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2022-07-12 18:21:44,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-12 18:21:44,263 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:21:44,263 INFO L195 NwaCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:21:44,295 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-12 18:21:44,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:44,464 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-12 18:21:44,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:21:44,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1062251221, now seen corresponding path program 25 times [2022-07-12 18:21:44,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:21:44,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24010567] [2022-07-12 18:21:44,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:21:44,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:21:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:45,274 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 435 proven. 704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:45,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:21:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24010567] [2022-07-12 18:21:45,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24010567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:21:45,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1652261515] [2022-07-12 18:21:45,274 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2022-07-12 18:21:45,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:45,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:21:45,276 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-12 18:21:45,278 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-12 18:21:45,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:45,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 923 conjuncts, 171 conjunts are in the unsatisfiable core [2022-07-12 18:21:45,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:21:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:46,229 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:21:47,081 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-12 18:21:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1139 backedges. 496 proven. 643 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:47,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1652261515] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:21:47,164 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:21:47,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 40, 40] total 82 [2022-07-12 18:21:47,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557972027] [2022-07-12 18:21:47,165 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:21:47,165 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 83 states [2022-07-12 18:21:47,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:21:47,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2022-07-12 18:21:47,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=776, Invalid=6030, Unknown=0, NotChecked=0, Total=6806 [2022-07-12 18:21:47,167 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:49,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 18:21:49,218 INFO L93 Difference]: Finished difference Result 153 states and 154 transitions. [2022-07-12 18:21:49,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-07-12 18:21:49,218 INFO L78 Accepts]: Start accepts. Automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 146 [2022-07-12 18:21:49,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 18:21:49,219 INFO L225 Difference]: With dead ends: 153 [2022-07-12 18:21:49,219 INFO L226 Difference]: Without dead ends: 153 [2022-07-12 18:21:49,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 247 SyntacticMatches, 2 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3186 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=2753, Invalid=11767, Unknown=0, NotChecked=0, Total=14520 [2022-07-12 18:21:49,221 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 547 mSDsluCounter, 1009 mSDsCounter, 0 mSdLazyCounter, 3083 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 3254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 3083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-12 18:21:49,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 1049 Invalid, 3254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 3083 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-12 18:21:49,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-07-12 18:21:49,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2022-07-12 18:21:49,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 150 states have (on average 1.0133333333333334) internal successors, (152), 150 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:49,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 152 transitions. [2022-07-12 18:21:49,224 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 152 transitions. Word has length 146 [2022-07-12 18:21:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 18:21:49,224 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 152 transitions. [2022-07-12 18:21:49,224 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 83 states, 82 states have (on average 3.5609756097560976) internal successors, (292), 83 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-12 18:21:49,225 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 152 transitions. [2022-07-12 18:21:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-12 18:21:49,225 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 18:21:49,225 INFO L195 NwaCegarLoop]: trace histogram [19, 18, 18, 18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 18:21:49,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-07-12 18:21:49,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:49,439 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-12 18:21:49,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 18:21:49,440 INFO L85 PathProgramCache]: Analyzing trace with hash -2125072764, now seen corresponding path program 26 times [2022-07-12 18:21:49,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 18:21:49,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593011281] [2022-07-12 18:21:49,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 18:21:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 18:21:49,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 18:21:52,052 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 36 proven. 1173 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:52,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 18:21:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593011281] [2022-07-12 18:21:52,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593011281] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-12 18:21:52,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1854117903] [2022-07-12 18:21:52,052 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-12 18:21:52,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-12 18:21:52,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 18:21:52,054 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-12 18:21:52,054 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-12 18:21:52,313 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-12 18:21:52,314 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-12 18:21:52,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 957 conjuncts, 281 conjunts are in the unsatisfiable core [2022-07-12 18:21:52,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-12 18:21:52,325 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-12 18:21:53,333 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-12 18:21:53,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:53,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:54,092 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:54,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:54,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:54,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:54,984 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:55,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:55,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-12 18:21:55,717 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:55,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:56,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select 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-12 18:21:56,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:56,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:57,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:57,335 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:57,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 19 [2022-07-12 18:21:57,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:21:57,866 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-12 18:21:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 496 proven. 713 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-12 18:21:58,172 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-12 18:22:03,327 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| Int)) (or (<= (+ 19 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (select |c_#length| |c_ULTIMATE.start_cstrncpy_~src~0#1.base|)) (not (<= |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| |c_ULTIMATE.start_cstrncpy_~src~0#1.offset|)) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|)) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_cstrncpy_~dst~0#1.base| v_ArrVal_2736) |c_ULTIMATE.start_cstrncpy_~src~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| 17)) 0))) is different from false [2022-07-12 18:22:03,336 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2736 (Array Int Int)) (|v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| Int)) (or (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~nondetArea~0#1.base| v_ArrVal_2736) |c_ULTIMATE.start_main_~nondetString~0#1.base|) (+ |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574| 17)) 0) (< |c_ULTIMATE.start_main_~nondetString~0#1.offset| |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (not (<= 0 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|)) (<= (+ 19 |v_ULTIMATE.start_cstrncpy_#t~post4#1.offset_574|) (select |c_#length| |c_ULTIMATE.start_main_~nondetString~0#1.base|)))) is different from false [2022-07-12 18:22:03,344 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:03,344 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-12 18:22:03,350 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-12 18:22:03,350 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-12 18:22:03,355 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-12 18:22:03,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 12 [2022-07-12 18:22:05,564 INFO L134 CoverageAnalysis]: Checked inductivity of 1209 backedges. 496 proven. 695 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2022-07-12 18:22:05,564 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1854117903] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-12 18:22:05,564 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-12 18:22:05,564 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [77, 60, 60] total 195 [2022-07-12 18:22:05,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137113535] [2022-07-12 18:22:05,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-12 18:22:05,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 195 states [2022-07-12 18:22:05,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 18:22:05,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 195 interpolants. [2022-07-12 18:22:05,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1994, Invalid=35052, Unknown=18, NotChecked=766, Total=37830 [2022-07-12 18:22:05,567 INFO L87 Difference]: Start difference. First operand 151 states and 152 transitions. Second operand has 195 states, 195 states have (on average 2.2666666666666666) internal successors, (442), 195 states have internal predecessors, (442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)